作者: Fabrizio Luccio , Linda Pagli
DOI: 10.1007/978-3-540-72914-3_21
关键词:
摘要: Graphides cincinnatae (also known as circulant graphs) Cin(L) of n vertices are studied here link farms in the Web, built automatically by a spammer to promote visibility page T. These graphs k-consecutive, denoted Cin.k, if each vertex vi is connected vi+j and vi-j with j = 1, 2, ..., k. cirratae some irregularities. We discuss how fight this phenomenon set Web marshals, that autonomous agents visit farm for cutting links The reacts reconstructing through majority voting among its pages. prove upper lower bounds on number hops, needed dismantle farm. consider both synchronous asynchronous operations.