A local algorithm for finding dense subgraphs

ACM Transactions on Algorithms

Volumn 6, Issue 4, 2010, Pages

  Andersen, Reid ^a  

^a MICROSOFT   (United States)

Author keywords

Dense subgraphs; Local algorithms; Spectral graph theory

Indexed keywords

BIPARTITE GRAPHS; HIGH DENSITY; INDUCED SUBGRAPHS; INPUT GRAPHS; LOCAL ALGORITHM; MAXIMUM DEGREE; RUNNING TIME; SPECTRAL GRAPH THEORY; SUBGRAPHS;

APPROXIMATION ALGORITHMS;

GRAPH THEORY;

EID: 77956529455     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1824777.1824780     Document Type: Conference Paper

References (18)

1. ANDERSEN, R. 2008. A local algorithm for finding dense subgraphs. In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'08). 1003-1009.
2. ANDERSEN, R. AND CHELLAPILLA, K. 2009. Finding dense subgraphs with size bounds. In Proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph (WAW'09). 25-37.
3. ANDERSEN, R., CHUNG, F., AND LANG, K. 2006. Local graph partitioning using pagerank vectors. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06). 475-486.
4. ANDERSEN, R. AND CIOABA, S. M. 2007. Spectral densest subgraph and independence number of a graph. J. Univer. Comput. Sci. 13, 11, 1501-1513.
5. BILU, Y.AND LINIAL, N. 2004. Constructing expander graphs by 2-lifts and discrepancy vs. spectral gap. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS'04). 404-412.
6. CHARIKAR, M. 2000. Greedy approximation algorithms for finding dense components in a graph. In Proceedings of the 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX'00).
7. FEIGE, U., PELEG, D., AND KORTSARZ, G. 2001. The dense k-subgraph problem. Algorithmica 29, 3, 410-421.
8. FEIGE, U. AND SELTSER, M. 1997. On the densest k-subgraph problem. Tech. rep. CS97-16. 1,.
9. GALLO, G., GRIGORIADIS, M.D., AND TARJAN, R. E. 1989. A fast parametric maximum flow algorithm and applications. SIAM J. Comput. 18, 1, 30-55.
10. GIBSON, D., KUMAR, R., AND TOMKINS, A. 2005. Discovering large dense subgraphs in massive graphs. In Proceedings of the 31st International Conference on Very Large Data Bases (VLDB'05). 721-732.
11. GOLDBERG, A. 1984. Finding a maximum density subgraph. Tech. rep. UCB CSD 84/71, University of California, Berkeley.
12. KANNAN, R. AND VINAY, V. 1999. Analyzing the structure of large graphs. Manuscript. http://research.microsoft.com/en-us/um/people/kannan/Papers/ webgraph.pdf.
13. KHULLER, S. AND SAHA, B. 2009. On finding dense subgraphs. In Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP'09). 597-608.
14. KORTSARZ, G. AND PELEG, D. 1994. Generating sparse 2-spanners. J. Algor. 17, 2, 222-236.
15. KUMAR, R., RAGHAVAN, P., RAJAGOPALAN, S., AND TOMKINS, A. 1999. Trawling the web for emerging cyber-communities. In Proceedings of the 8th World Wide Web Conference (WWW'99). 403-416.
16. NAOR, M. AND STOCKMEYER, L. 1995. What can be computed locally? SIAM J. Comput. 24, 6, 1259-1277.
17. SPIELMAN, D.A.AND TENG, S.-H. 2004. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC'04). ACM Press, New York, 81-90.
18. SPIELMAN, D.A.AND TENG, S.-H. 2008. A local clustering algorithm for massive graphs and its application to nearly-linear time graph partitioning. CoRR abs/0809.3232.