Density-constrained graph clustering

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

Volumn 6844 LNCS, Issue , 2011, Pages 679-690

  Görke, Robert ^a   Schumm, Andrea ^a   Wagner, Dorothea ^a  

^a KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BEHAVIORAL TRAITS; BI-CRITERIA; CLUSTERINGS; GRAPH CLUSTERING; GRAPH CUT; NP-HARDNESS; QUALITY MEASURES; ALGORITHMIC EFFICIENCIES; INTER CLUSTERS;

AGGLOMERATION; DATA STRUCTURES;

ALGORITHMS; GRAPHIC METHODS;

EID: 80052109689     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22300-6_58     Document Type: Conference Paper

References (13)

1. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A.: Complexity and approximation - Combinatorial Optimization Problems and Their Approximability Properties, 2nd edn. Springer, Heidelberg (2002)
2. Berkhin, P.: A Survey of Clustering Data Mining Techniques. In: Grouping Multi-dimensional Data: Recent Advances in Clustering, pp. 25-71. Springer, Heidelberg (2006)
3. Brandes, U., Gaertler, M., Wagner, D.: Engineering Graph Clustering: Models and Experimental Evaluation. ACM J. of Exp. Algorithmics 12(1.1), 1-26 (2007)
4. Chataigner, F., Manic, G., Wakabayashi, Y., Yuster, R.: Approximation algorithms and hardness results for the clique packing problem. Electronic Notes in Discrete Mathematics 29, 397-401 (2007)
5. Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Physical Review E 70(066111) (2004)
6. Flake, G.W., Tarjan, R.E., Tsioutsiouliklis, K.: Graph Clustering and Minimum Cut Trees. Internet Mathematics 1(4), 385-408 (2004)
7. Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3-5), 75-174 (2009)
8. Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)
9. Görke, R., Schumm, A., Wagner, D.: Density-Constrained Graph Clustering. Technical report, ITI Wagner, Department of Informatics, Karlsruhe Institute of Technology (KIT), Karlsruhe Reports in Informatics 2011-2017 (2011)
10. Jain, A.K., Dubes, R.C.: Algorithms for Clustering Data. Prentice Hall, Englewood Cliffs (1988)
11. Kannan, R., Vempala, S., Vetta, A.: On Clusterings - Good, Bad and Spectral. In: Proc. of FOCS 2000, pp. 367-378 (2000)
12. Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Physical Review E 69(026113) (2004)
13. Zachary, W.W.: An Information Flow Model for Conflict and Fission in Small Groups. Journal of Anthropological Research 33, 452-473 (1977)