A local algorithm for finding dense subgraphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 1003-1009

  Andersen, Reid ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CLUSTERING ALGORITHMS; GRAPH THEORY;

GRAPH ALGORITHMS; GRAPH PARTITIONING; LOCAL ALGORITHMS; LOCAL APPROXIMATION; MAXIMUM (WEIGHTED) DEGREE; RUNNING TIME; SUB GRAPHS;

APPROXIMATION ALGORITHMS;

EID: 58449110601     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. R. Andersen, F. Chung, and K. Lang. Local graph partitioning using pagerank vectors. In FOCS '06: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), pages 475-486, Washington, DC, USA, 2006. IEEE Computer Society.
2. Y. Bilu and N. Linial. Constructing expander graphs by 2-lifts and discrepancy vs. spectral gap. In FOCS '04: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS'04), pages 404-412, Washington, DC, USA, 2004. IEEE Computer Society.
3. M. Charikar. Greedy approximation algorithms for finding dense components in a graph. In APPROX 2000, Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization, 2000.
4. U. Feige, D. Peleg, and G. Kortsarz. The dense ksubgraph problem. Algorithmca, 29(3):410-421, 2001.
5. U. Feige and M. Seltser. On the densest k-subgraph problem. Technical Report CS97-16, 1, 1997.
6. G. Gallo, M. D. Grigoriadis, and R. E. Tarjan. A fast parametric maximum flow algorithm and applications. SIAM J. Comut., 18(1);30-55, 1989.
7. D. Gibson, R. Kumar, and A. Tomkins. Discovering large dense subgraphs in massive graphs, 2005.
8. A. Goldberg. Finding a maximum density subgraph. Technical Report UCB CSD 84/71, University of California, Berkeley, 1984.
9. R. Kannan and V. Vinay. Analyzing the structure of large graphs. Manuscript, 1999.
10. G. Kortsarz and D. Peleg. Generating sparse 2- spanners. J. Algorithms, 17(2):222-236, 1994.
11. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Trawling the Web for emerging cyber-communities. Computer Networks (Amsterdam, Netherlands: 1999), 31(11-16):1481-1493, 1999.
12. M. Naor and L. Stockmeyer. What can be computed locally? SIAM J. Comput., 24(6):1259-1277, 1995.
13. D. A. Spielman and S.-H. Teng. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In ACM STOC-04, pages 81-90, New York, NY, USA, 2004. ACM Press.