On finding dense subgraphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5555 LNCS, Issue PART 1, 2009, Pages 597-608

  Khuller, Samir ^a   Saha, Barna ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTANT FACTORS; DIRECTED GRAPHS; FAST ALGORITHMS; FLOW BASED; LINEAR TIME; LOWER BOUNDS; MAXIMUM DENSITY; NP COMPLETE; NP-HARD; OPTIMUM DENSITY; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; SIZE CONSTRAINT; SUBGRAPH PROBLEMS; SUBGRAPHS; UNDIRECTED GRAPH; UPPER BOUND; VERTEX SET;

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONTROL THEORY; LINGUISTICS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; SET THEORY; TRANSLATION (LANGUAGES);

GRAPH THEORY;

EID: 70449135268     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02927-1_50     Document Type: Conference Paper

References (16)

1. Andersen, R.: Finding large and small dense subgraphs. CoRR, abs/cs/0702032 (2007)
2. Andersen, R., Chellapilla, K.: Finding dense subgraphs with size bounds. In: Avrachenkov, K.E., Donato, D., Litvak, N. (eds.) WAW 2009. LNCS, vol. 5427, pp. 25-36. Springer, Heidelberg (2009)
3. Asahiro, Y., Hassin, R., Iwama, K.: Complexity of finding dense subgraphs. Discrete Appl. Math. 121(1-3), 15-26 (2002)
4. Asahiro, Y., Iwama, K., Tamaki, FL, Tokuyama, T.: Greedily finding a dense subgraph. In: Karlsson, R., Lingas, A. (eds.) SWAT 1996. LNCS, vol. 1097, pp. 136-148. Springer, Heidelberg (1996)
5. Buehrer, G., Chellapilla, K.: A scalable pattern mining approach to web graph compression with communities. In: WSDM 2008, pp. 95-106 (2008)
6. Charikar, M.: Greedy approximation algorithms for finding dense components in a graph. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol. 1913, pp. 84-95. Springer, Heidelberg (2000)
7. Dourisboure, Y., Geraci, F., Pellegrini, M.: Extraction and classification of dense communities in the web. In: WWW 2007, pp. 461-470 (2007)
8. Feige, U., Kortsarz, G., Peleg, D.: The dense k-subgraph problem. Algorithmica 29, 410-421 (1997)
9. Gallo, G., Grigoriadis, M.D., Tarjan, R.E.: A fast parametric maximum flow algorithm and applications. SIAM J. Comput. 18(1), 30-55 (1989)
10. Gibson, D., Kumar, R., Tomkins, A.: Discovering large dense subgraphs in massive graphs. In: VLDB 2005, pp. 721-732 (2005)
11. Goldberg, A.V.: Finding a maximum density subgraph. Technical report (1984)
12. Kannan, R., Vinay, V.: Analyzing the structure of large graphs. Technical report (1999)
13. Khot, S.: Ruling out ptas for graph min-bisection, dense k-subgraph, and bipartite clique. SIAM J. Comput. 36(4), 1025-1071 (2006)
14. Khuller, S., Saha, B.: On finding dense subgraphs (2009), http://www.es.umd.edu/~samir/grant/ICALP09.pdf
15. Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. J. ACM 46(5), 604-632 (1999)
16. Lawler, E.: Combinatorial optimization - networks and matroids. Holt, Rinehart and Winston, New York (1976)