A 2k kernel for the cluster editing problem

Journal of Computer and System Sciences

Volumn 78, Issue 1, 2012, Pages 211-220

  Chen, Jianer ^a   Meng, Jie ^a  

^a Department of Electrical and Computer Engineering   (United States)

Author keywords

Cluster editing; Critical clique; Kernelization; NP hard problem; Parameterized computation

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH ALGORITHMS; NP-HARD; PARAMETER ESTIMATION; POLYNOMIAL APPROXIMATION;

CLUSTER EDITING; CRITICAL CLIQUE; DECISION PROBLEMS; ITS APPLICATIONS; KERNELIZATION; PARAMETERIZED COMPUTATION; POLYNOMIAL-TIME; TIME ALGORITHMS;

GRAPH THEORY;

EID: 81955168117     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2011.04.001     Document Type: Conference Paper

References (20)

1. N. Bansal, A. Blum, and S. Chawla Correlation clustering Machine Learning 56 1 2004 89 113
2. A. Ben-dor, R. Shamir, and Z. Yakhini Clustering gene expression patterns J. Comput. Biol. 6 3/4 1999 281 297
3. P. Berkhin A survey of clustering data mining techniques Grouping Multidimensional Data 2006 Springer Berlin, Heidelberg 25 71
4. S. Böcker, S. Briesemeister, Q. Bui, and A. Truss Going weighted: parameterized algorithms for cluster editing Theoret. Comput. Sci. 410 52 2009 5467 5480
5. M. Charikar, V. Guruswami, and A. Wirth Clustering with qualitative information J. Comput. System Sci. 71 3 2005 360 383 (Pubitemid 41278185)
6. Z.-Z. Chen, T. Jiang, and G. Lin Computing phylogenetic roots with bounded degrees and errors SIAM J. Comput. 32 4 2003 864 879
7. J. Dean, and M.R. Henzinger Finding related pages in the World Wide Web Computer Networks 31 1999 1467 1479
8. F. Dehne, M. Langston, X. Luo, S. Pitre, P. Shaw, Y. Zhang, The cluster editing problem: implementations and experiments, in: Proc. of IWPEC 2006, in: Lecture Notes in Comput. Sci., vol. 4169, 2006, pp. 13-24. (Pubitemid 44609908)
9. M. Fellows, The lost continent of polynomial time: preprocessing and kernelization, in: Proc. of IWPEC 2006, in: Lecture Notes in Comput. Sci., vol. 4169, 2006, pp. 276-277. (Pubitemid 44609931)
10. M. Fellows, M. Langston, F. Rosamond, P. Shaw, Efficient parameterized preprocessing for cluster editing, in: Proc. of FCT 07, in: Lecture Notes in Comput. Sci., vol. 4639, 2007, pp. 312-321.
11. J. Gramm, J. Guo, F. Huffner, and R. Niedermeier Automated generation of search tree algorithms for hard graph modification problems Algorithmica 39 4 2004 321 347 (Pubitemid 40871661)
12. J. Gramm, J. Guo, F. Huffner, and R. Niedermeier Graph-modeled data clustering: exact algorithms for clique generation Theory Comput. Syst. 38 4 2005 373 392 (Pubitemid 40997666)
13. J. Guo A more effective linear kernelization for cluster editing Theoret. Comput. Sci. 410 8-10 2009 718 726
14. M.A. Hearst, J.O. Pedersen, Reexamining the cluster hypothesis: scatter/gather on retrieval results, in: Proc. of SIGIR, 1996, pp. 76-84.
15. W. Hsu, T. Ma, Substitution decomposition on chordal graphs and applications, in: Proc. of ISA 91, in: Lecture Notes in Comput. Sci., vol. 557, 1991, pp. 52-60.
16. A. Jain, and R. Dubes Algorithms for Clustering Data 1988 Prentice-Hall
17. G. Lin, P.E. Kearney, T. Jiang, Phylogenetic k-root and steiner k-root, in: Proc. of ISAAC 2000, in: Lecture Notes in Comput. Sci., vol. 1969, 2000, pp. 539-551. (Pubitemid 33209853)
18. R. Shamir, and R. Sharan Algorithmic approaches to clustering gene expression data T. Jiang, Y. Xu, M. Zhang, Current Topics in Computational Molecular Biology 2002 MIT Press 269 299
19. R. Shamir, R. Sharan, and D. Tsur Cluster graph modification problems Discrete Appl. Math. 144 2004 173 182
20. A. Zuylen, D. Williamson, Deterministic algorithms for rank aggregation and other ranking and clustering problems, in: Proc. of WAOA 2007, in: Lecture Notes in Comput. Sci., vol. 4927, 2007, pp. 260-273.