Cluster editing with locally bounded modifications

Discrete Applied Mathematics

Volumn 160, Issue 15, 2012, Pages 2259-2270

  Komusiewicz, Christian ^a   Uhlmann, Johannes ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Data reduction; Exponential time hypothesis; Graph modification problems; Parameterized algorithmics

Indexed keywords

ALGORITHMICS; COMBINED PARAMETER; DEGREE BOUNDS; EDGE MODIFICATION; EXPONENTIAL-TIME HYPOTHESIS; GRAPH MODIFICATIONS; KERNELIZATION; MAXIMUM DEGREE; NONNEGATIVE INTEGERS; NP-HARD; NP-HARDNESS; NUMBER OF CLUSTERS; RUNNING TIME; UNDIRECTED GRAPH;

COMPUTATIONAL COMPLEXITY; DATA REDUCTION; INTEGER PROGRAMMING;

GRAPH THEORY;

EID: 84864760777     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2012.05.019     Document Type: Conference Paper

References (26)

1. N. Alon, D. Lokshtanov, and S. Saurabh Fast FAST Proceedings of the 36th International Colloquium on Automata, Languages and Programming, ICALP'09, Part 1 Lecture Notes in Computer Science vol. 5555 2009 Springer 49 58
2. N. Bansal, A. Blum, and S. Chawla Correlation clustering Machine Learning 56 1-3 2004 89 113
3. S. Böcker, A golden ratio parameterized algorithm for cluster editing, Journal of Discrete Algorithms (2012) electronically available (in press).
4. S. Böcker, S. Briesemeister, Q.B.A. Bui, and A. Truß Going weighted: parameterized algorithms for cluster editing Theoretical Computer Science 410 52 2009 5467 5480
5. S. Böcker, S. Briesemeister, and G.W. Klau Exact algorithms for cluster editing: evaluation and experiments Algorithmica 60 2 2011 316 334
6. S. Böcker, and P. Damaschke Even faster parameterized cluster deletion and cluster editing Information Processing Letters 111 14 2011 717 721
7. Y. Cao, and J. Chen Cluster editing: kernelization based on edge cuts Proceedings of the 5th International Symposium on Parameterized and Exact Computation IPEC'10 Lecture Notes in Computer Science vol. 6478 2010 Springer 60 71
8. J. Chen, and J. Meng A 2 k kernel for the cluster editing problem Journal of Computer and System Sciences 78 1 2012 211 220
9. R.G. Downey, and M.R. Fellows Parameterized Complexity 1999 Springer
10. J. Flum, and M. Grohe Parameterized Complexity Theory 2006 Springer
11. F.V. Fomin, S. Kratsch, M. Pilipczuk, M. Pilipczuk, Y. Villanger, Subexponential fixed-parameter tractability of cluster editing, CoRR, abs/1112.4419, 2011.
12. H.N. Gabow, and R.E. Tarjan Faster scaling algorithms for general graph-matching problems Journal of the ACM 38 4 1991 815 853
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
14. J. Guo A more effective linear kernelization for cluster editing Theoretical Computer Science 410 8-10 2009 718 726
15. R. Impagliazzo, R. Paturi, and F. Zane Which problems have strongly exponential complexity? Journal of Computer and System Sciences 63 4 2001 512 530
16. M. Karpinski, and W. Schudy Faster algorithms for feedback arc set tournament, Kemeny rank aggregation and betweenness tournament Proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC'10, Part 1 Lecture Notes in Computer Science vol. 6506 2010 3 14
17. C. Komusiewicz, Parameterized algorithmics for network analysis: clustering & querying. Ph.D. Thesis, Technische Universität Berlin, Berlin, Germany, 2011.
18. C. Komusiewicz, and J. Uhlmann Alternative parameterizations for cluster editing Proceedings of the 37th International Conference on Current Trends in Theory and Practice of Computer Science SOFSEM'11 Lecture Notes in Computer Science vol. 6543 2011 Springer 344 355
19. M. Kivánek, and J. Morávek NP-hard problems in hierarchical-tree clustering Acta Informatica 23 3 1986 311 323
20. D. Lokshtanov, D. Marx, and S. Saurabh Lower bounds based on the exponential time hypothesis Bulletin of the European Association for Theoretical Computer Science 105 2011 41 72
21. R. Niedermeier Invitation to Fixed-Parameter Algorithms Number 31 in Oxford Lecture Series in Mathematics and Its Applications 2006 Oxford University Press
22. R. Shamir, R. Sharan, and D. Tsur Cluster graph modification problems Discrete Applied Mathematics 144 1-2 2004 173 182
23. J. Uhlmann, Multivariate algorithmics in biological data analysis, Ph.D. Thesis, Technische Universität Berlin, Berlin, Germany, 2011.
24. J.M.M. van Rooij, M.E. van Kooten Niekerk, and H.L. Bodlaender Partition into triangles on bounded degree graphs Proceedings of the 37th Conference on Current Trends in Theory and Practice of Computer Science SOFSEM'11 Lecture Notes in Computer Science vol. 6543 2011 Springer 558 569
25. M. Weller, C. Komusiewicz, R. Niedermeier, and J. Uhlmann On making directed graphs transitive Journal of Computer and System Sciences 78 2 2012 559 574
26. G.J. Woeginger Exact algorithms for NP-hard problems: a survey Combinatorial Optimization Lecture Notes in Computer Science vol. 2570 2003 Springer 185 208