Skip to main content
SpringerLink
Log in

Web Marshals Fighting Curly Link Farms

  • Conference paper
Fun with Algorithms (FUN 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4475))

Included in the following conference series:

Abstract

Graphides cincinnatae (also known as circulant graphs) Ci n (L) of n vertices are studied here as link farms in the Web, built automatically by a spammer to promote visibility of a page T. These graphs are k-consecutive, denoted by Cin,k, if each vertex v i is connected to vi + j and vi − j with j = 1,2,...,k. Graphides cirratae are cincinnatae with some irregularities. We discuss how to fight this phenomenon with a set of Web marshals, that is autonomous agents that visit the farm for cutting the links to T. The farm reacts reconstructing the links through majority voting among its pages. We prove upper and lower bounds on the number of marshals, and of link hops, needed to dismantle the farm. We consider both synchronous and asynchronous operations.

Regular Keywords: Circulant graph, Web graph, Page-rank, Web spam, Link farm, Autonomous agent, Majority rule.

Elegant Keywords: Graphis cincinnata, Graphis cirrata, Curly graph, Web marshal.

As to now, no foreseeing institution has sponsored this research.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Becchetti, L., et al.: Link-Based Characterization and Detection of Web Spam. In: Proc. AIRWeb’06, Seattle (2006)

    Google Scholar 

  2. Buckley, F., Harary, F.: Distance in Graphs. Addison-Wesley, Redwood City,CA (1990)

    MATH  Google Scholar 

  3. Du, Y., Shi, Y., Zhao, X.: Using Spam Farm to Boost Page Rank, Manuscript under publication (2006)

    Google Scholar 

  4. Flocchini, P., Huang, M.J., Luccio, F.L.: Contiguous Search in the Hypercube for Capturing an Intruder. In: Proc. 19th IEEE International Parallel and Distributed Processing Symp. Denver, pp. 62–71. IEEE Computer Society Press, Los Alamitos (2005)

    Google Scholar 

  5. Gori, M., Witten, I.: The Bubble of Web Visibility. Communications of the ACM 48(3), 115–117 (2005)

    Article  Google Scholar 

  6. Gyöngyi, Z., Garcia-Molina, H.: Web Spam Taxonomy. In: Proc. AIRWeb’05, Chiba (2005)

    Google Scholar 

  7. Gyöngyi, Z., Garcia-Molina, H.: Link Spam Alliances. In: Proc. VLDB’05, Trondheim, pp. 517–528 (2005)

    Google Scholar 

  8. Luccio, F., Pagli, L., Santoro, N.: Network Decontamination with Local Immunization. In: Proc. APDCM’06, Rhodes (2006)

    Google Scholar 

  9. Peleg, D.: Size Bounds for Dynamic Monopolies. In: Proc. SIROCCO 97, Ascona, pp. 151–161 (1997)

    Google Scholar 

  10. West, D.B.: Introduction to Graph Theory. Prentice-Hall, Englewood Cliffs (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, Italy

    Fabrizio Luccio & Linda Pagli

Authors
  1. Fabrizio Luccio
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Linda Pagli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Sistemi e Informatica, Università degli Studi di Firenze, Viale Morgagni 65, 50134, Firenze, Italy

    Pierluigi Crescenzi

  2. Dipartimento di Informatica, Università degli Studi di Pisa, Largo Bruno Pontecorvo 3, 56127, Pisa, Italy

    Giuseppe Prencipe

  3. Dipartimento di Ingegneria dell’Informazione, Università degli Studi di Padova, Via Gradenigo 6/B, 35131, Padova, Italy

    Geppino Pucci

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Luccio, F., Pagli, L. (2007). Web Marshals Fighting Curly Link Farms . In: Crescenzi, P., Prencipe, G., Pucci, G. (eds) Fun with Algorithms. FUN 2007. Lecture Notes in Computer Science, vol 4475. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72914-3_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72914-3_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72913-6

  • Online ISBN: 978-3-540-72914-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation