Communications of the ACM - The disappearing computer
Contiguous Search in the Hypercube for Capturing an Intruder
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
VLDB '05 Proceedings of the 31st international conference on Very large data bases
A distributed dynamics for webgraph decontamination
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Triggering cascades on undirected connected graphs
Information Processing Letters
The effect of intelligent escape on distributed SER-Based search
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part I
| Hi-index | 0.01 |
Graphides cincinnatae (also known as circulant graphs) Cin(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 vi 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.