We present an algorithm, witch, that learns to detect spam hosts or pages on the Web. Unlike most other approaches, it simultaneously exploits the structure of the Web graph as wel...
Jacob Abernethy, Olivier Chapelle, Carlos Castillo
The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs...
Abstract. The web graph is a real-world self-organizing network whose vertices correspond to web pages, and whose edges correspond to links between pages. Many stochastic models fo...
A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canon...