Graph-based data clustering with overlaps

Discrete Optimization

Volumn 8, Issue 1, 2011, Pages 2-17

  Fellows, Michael R ^a   Guo, Jiong ^b   Komusiewicz, Christian ^c   Niedermeier, Rolf ^c   Uhlmann, Johannes ^c  

^a CHARLES DARWIN UNIVERSITY   (Australia)

^b SAARLAND UNIVERSITY   (Germany)

^c FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

Cluster graph modification problems; Fixed parameter tractability; Forbidden subgraph characterization; Kernelization; NP hardness; W 1 hardness

Indexed keywords

FIXED-PARAMETER TRACTABILITY; FORBIDDEN SUBGRAPH CHARACTERIZATION; GRAPH MODIFICATIONS; KERNELIZATION; NP-HARDNESS; W [1]-HARDNESS;

CHARACTERIZATION; HARDNESS; PARAMETER ESTIMATION;

CLUSTERING ALGORITHMS;

EID: 79952186886     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2010.09.006     Document Type: Article

References (36)

1. S.E. Schaeffer Graph clustering Computer Science Review 1 1 2007 27 64
2. R. Shamir, R. Sharan, and D. Tsur Cluster graph modification problems Discrete Applied Mathematics 144 12 2004 173 182
3. R. Xu, and D. Wunsch II Survey of clustering algorithms IEEE Transactions on Neural Networks 16 3 2005 645 678 (Pubitemid 40718010)
4. A. Ben-Dor, R. Shamir, and Z. Yakhini Clustering gene expression patterns Journal of Computational Biology 6 34 1999 281 292
5. R. Sharan, A. Maron-Katz, and R. Shamir CLICK and EXPANDER: a system for clustering and visualizing gene expression data Bioinformatics 19 14 2003 1787 1799 (Pubitemid 37220471)
6. Z. Wu, and R. Leahy An optimal graph theoretic approach to data clustering: theory and its application to image segmentation IEEE Transactions on Pattern Analysis and Machine Intelligence 15 11 1993 1101 1113
7. S. Bcker, S. Briesemeister, Q.B.A. Bui, and A. Truß A fixed-parameter approach for weighted cluster editing Proc. 6th APBC Advances in Bioinformatics and Computational Biology vol. 5 2008 Imperial College Press 211 220
8. S. Bcker, S. Briesemeister, G.W. Klau, Exact algorithms for cluster editing: evaluation and experiments, Algorithmica (2010) electronically available, in press (doi:10.1007/s00453-009-9339-7 ).
9. J. Chen, and J. Meng A 2 k kernel for the cluster editing problem Proc. 16th COCOON LNCS vol. 6196 2010 Springer 459 468
10. P. Damaschke Fixed-parameter enumerability of cluster editing and related problems Theory of Computing Systems 46 2 2010 261 283
11. F. Dehne, M.A. Langston, X. Luo, S. Pitre, P. Shaw, and Y. Zhang The cluster editing problem: implementations and experiments Proc. 2nd IWPEC LNCS vol. 4169 2006 Springer 13 24 (Pubitemid 44609908)
12. M.R. Fellows, M.A. Langston, F.A. Rosamond, and P. Shaw Efficient parameterized preprocessing for cluster editing Proc. 16th FCT LNCS vol. 4639 2007 Springer 312 321
13. J. Gramm, J. Guo, F. Hüffner, and R. Niedermeier Graph-modeled data clustering: exact algorithms for clique generation Theory of Computing Systems 38 4 2005 373 392 (Pubitemid 40997666)
14. J. Guo A more effective linear kernelization for cluster editing Theoretical Computer Science 410 810 2009 718 726
15. F. Protti, M.D. da Silva, and J.L. Szwarcfiter Applying modular decomposition to parameterized cluster editing problems Theory of Computing Systems 44 1 2009 91 104
16. G. Palla, I. Dernyi, I. Farkas, and T. Vicsek Uncovering the overlapping community structure of complex networks in nature and society Nature 435 7043 2005 814 818 (Pubitemid 40839731)
17. N. Bansal, A. Blum, and S. Chawla Correlation clustering Machine Learning 56 13 2004 89 113
18. S. Bcker, S. Briesemeister, Q.B.A. Bui, and A. Truß Going weighted: parameterized algorithms for cluster editing Theoretical Computer Science 410 52 2009 5467 5480
19. J. Guo, C. Komusiewicz, R. Niedermeier, and J. Uhlmann A more relaxed model for graph-based data clustering: s-plex editing Proc. 5th AAIM LNCS vol. 5564 2009 Springer 226 239 Long version to appear in SIAM Journal on Discrete Mathematics
20. P. Heggernes, D. Lokshtanov, J. Nederlof, C. Paul, J.A. Telle, Generalized graph clustering: recognizing (p, q ) -cluster graphs, in: Proc. 36th WG, in: LNCS, Springer (2010) (in press).
21. J.-P. Barthlemy, and F. Brucker NP-hard approximation problems in overlapping clustering Journal of Classification 18 2 2001 159 183 (Pubitemid 33396000)
22. R.G. Downey, and M.R. Fellows Parameterized Complexity 1999 Springer
23. J. Flum, and M. Grohe Parameterized Complexity Theory 2006 Springer
24. R. Niedermeier Invitation to Fixed-Parameter Algorithms 2006 Oxford University Press
25. H.L. Bodlaender Kernelization: new upper and lower bound techniques Proc. 4th IWPEC LNCS vol. 5917 2009 Springer 17 37
26. J. Guo, and R. Niedermeier Invitation to data reduction and problem kernelization ACM SIGACT News 38 1 2007 31 45
27. K. Makino, and T. Uno New algorithms for enumerating all maximal cliques Proc. 9th SWAT LNCS vol. 3111 2004 Springer 260 272
28. D.L. Greenwell, R.L. Hemminger, J.B. Klerlein, Forbidden subgraphs, in: Proc. 4th Southeastern Conf. on Comb., Graph Theory and Computing, in: Utilitas Mathematica, 1973, pp. 389394.
29. M. Talmaciu, and E. Nechita Recognition algorithm for diamond-free graphs Informatica 18 3 2007 457 462
30. M. Kivnek, and J. Morvek NP-hard problems in hierarchical-tree clustering Acta Informatica 23 3 1986 311 323
31. R. Peeters The maximum edge biclique problem is NP-complete Discrete Applied Mathematics 131 3 2003 651 654
32. L. Cai Fixed-parameter tractability of graph modification problems for hereditary properties Information Processing Letters 58 4 1996 171 176 (Pubitemid 126374630)
33. S. Micali, and V.V. Vazirani An O ( (| V | ) | E | ) algorithm for finding maximum matching in general graphs Proc. 21st FOCS 1980 IEEE 17 27
34. W. Hsu, and T. Ma Substitution decomposition on chordal graphs and applications Proc. 2nd International Symposium on Algorithms LNCS vol. 557 1991 Springer 52 60
35. R.M. McConnell, and J. Spinrad Linear-time modular decomposition and efficient transitive orientation of comparability graphs Proc. 5th SODA 1994 ACM/SIAM 536 545
36. J. Guo, I.A. Kanj, C. Komusiewicz, and J. Uhlmann Editing graphs into disjoint unions of dense clusters Proc. 20th ISAAC LNCS vol. 5878 2009 Springer 583 593