Book ChapterDOI
Greedy approximation algorithms for finding dense components in a graph
Reads0
Chats0
TLDR
This paper gives simple greedy approximation algorithms for these optimization problems of finding subgraphs maximizing these notions of density for undirected and directed graphs and answers an open question about the complexity of the optimization problem for directed graphs.Abstract:
We study the problem of finding highly connected subgraphs of undirected and directed graphs. For undirected graphs, the notion of density of a subgraph we use is the average degree of the subgraph. For directed graphs, a corresponding notion of density was introduced recently by Kannan and Vinay. This is designed to quantify highly connectedness of substructures in a sparse directed graph such as the web graph. We study the optimization problems of finding subgraphs maximizing these notions of density for undirected and directed graphs. This paper gives simple greedy approximation algorithms for these optimization problems. We also answer an open question about the complexity of the optimization problem for directed graphs.read more
Citations
More filters
Book ChapterDOI
Finding Dense Subgraphs with Size Bounds
Reid Andersen,Kumar Chellapilla +1 more
TL;DR: The main result is that dalks can be approximated efficiently, even for web-scale graphs, and is given a (1/3)-approximation algorithm for dalks that is based on the core decomposition of a graph, and that runs in time O(m + n), where n is the number of nodes and m is theNumber of edges.
Journal ArticleDOI
Fast Greedy Algorithms in MapReduce and Streaming
TL;DR: A powerful sampling technique that aids in parallelization of sequential algorithms and yields efficient algorithms that run in a logarithmic number of rounds while obtaining solutions that are arbitrarily close to those produced by the standard sequential greedy algorithm.
Journal ArticleDOI
Exploring the human genome with functional maps
Curtis Huttenhower,Erin M. Haley,Matthew A. Hibbs,Vanessa Dumeaux,Daniel R. Barrett,Hilary A. Coller,Olga G. Troyanskaya +6 more
TL;DR: Experimental investigation of five specific genes, AP3B1, ATP6AP1, BLOC1S1, LAMP2, and RAB11A, has confirmed novel roles for these proteins in the proper initiation of macroautophagy in amino acid-starved human fibroblasts.
Journal ArticleDOI
A survey of community search over big graphs
TL;DR: A comprehensive review of existing community search works can be found in this paper, where the authors analyze and compare the quality of communities under their models, and the performance of different solutions.
Journal ArticleDOI
Robust local community detection: on free rider effect and its elimination
TL;DR: This work systematically study the existing goodness metrics and provides theoretical explanations on why they may cause the free rider effect, and develops a query biased node weighting scheme to reduce the free riders effect.
References
More filters
Proceedings ArticleDOI
Authoritative sources in a hyperlinked environment
TL;DR: This work proposes and test an algorithmic formulation of the notion of authority, based on the relationship between a set of relevant authoritative pages and the set of \hub pages that join them together in the link structure, that has connections to the eigenvectors of certain matrices associated with the link graph.
Journal ArticleDOI
Trawling the Web for emerging cyber-communities
TL;DR: The subject of this paper is the systematic enumeration of over 100,000 emerging communities from a Web crawl, motivating a graph-theoretic approach to locating such communities, and describing the algorithms and algorithmic engineering necessary to find structures that subscribe to this notion.
Book ChapterDOI
The web as a graph: measurements, models, and methods
TL;DR: This paper describes two algorithms that operate on the Web graph, addressing problems from Web search and automatic community discovery, and proposes a new family of random graph models that point to a rich new sub-field of the study of random graphs, and raises questions about the analysis of graph algorithms on the Internet.
Proceedings ArticleDOI
Inferring Web communities from link topology
TL;DR: This investigation shows that although the process by which users of the Web create pages and links is very difficult to understand at a “local” level, it results in a much greater degree of orderly high-level structure than has typically been assumed.