A more effective linear kernelization for cluster editing

Theoretical Computer Science

Volumn 410, Issue 8-10, 2009, Pages 718-726

  Guo, Jiong ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

Combinatorial problems; Computational biology; Data reduction; Fixed parameter tractability; Preprocessing

Indexed keywords

BIOINFORMATICS; DATA REDUCTION; FOURIER TRANSFORMS; STATISTICS;

COMBINATORIAL PROBLEMS; COMPUTATIONAL BIOLOGY; EDGE MODIFICATIONS; FIXED-PARAMETER TRACTABILITY; KERNELIZATION; NP-HARD; POLYNOMIAL-TIME; PREPROCESSING; PROBLEM KERNELS; TIME ALGORITHMS; UNDIRECTED GRAPHS;

GRAPH THEORY;

EID: 59049089242     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.10.021     Document Type: Article

References (27)

1. Ailon N., Charikar M., and Newman A. Aggregating inconsistent information: Ranking and clustering. Proc. 37th ACM STOC (2005), ACM Press 684-693
2. Alber J., Fellows M.R., and Niedermeier R. Polynomial time data reduction for Dominating Set. Journal of the ACM 51 3 (2004) 363-384
3. Bansal N., Blum A., and Chawla S. Correlation clustering. Machine Learning 56 1 (2004) 89-113
4. Ben-Dor A., Shamir R., and Yakhini Z. Clustering gene expression patterns. Journal of Computational Biology 6 3/4 (1999) 281-297
5. Böcker S., Briesemeister S., Bui Q.B.A., and Truß A. A fixed-parameter approach for weighted cluster editing. Proc. 6th Asia-Pacific Bioinformatics Conference. APBC 2008. Series on Advances in Bioinformatics and Computational Biology vol. 5 (2008), Imperial College Press 211-220
6. Böcker S., Briesemeister S., Bui Q.B.A., and Truß A. Going weighted: Parameterized algorithms for cluster editing. Proc. 2nd COCOA. LNCS vol. 5165 (2008), Springer 1-12
7. Böcker S., Briesemeister S., and Klau G.W. Exact algorithms for cluster editing: Evaluation and experiments. Proc. 7th WEA. LNCS vol. 5038 (2008), Springer 289-302
8. Charikar M., Guruswami V., and Wirth A. Clustering with qualitative information. Journal of Computer and System Sciences 71 3 (2005) 360-383
9. Chen J., Fernau H., Kanj I.A., and Xia G. Parametric duality and kernelization: Lower bounds and upper bounds on kernel size. SIAM Journal on Computing 37 4 (2007) 1077-1106
10. Chen Z.-Z., Jiang T., and Lin G. Computing phylogenetic roots with bounded degrees and errors. SIAM Journal on Computing 32 4 (2003) 864-879
11. Dehne F., Langston M.A., Luo X., Pitre S., Shaw P., and Zhang Y. The Cluster Editing problem: Implementations and Experiments. Proc. 2nd IWPEC. LNCS vol. 4196 (2006), Springer 13-24
12. Dom M., Guo J., Hüffner F., and Niedermeier R. Extending the tractability border for closest leaf powers. Proc. 31st WG. LNCS vol. 3787 (2005), Springer 397-408 Long version unter the title "Closest 4-leaf power is fixed-parameter tractable" to appear in Discrete Applied Mathematics
13. Dom M., Guo J., Hüffner F., and Niedermeier R. Error compensation in leaf power problems. Algorithmica 44 4 (2006) 363-381
14. Downey R.G., and Fellows M.R. Parameterized Complexity (1999), Springer
15. Fellows M.R. The lost continent of polynomial time: Preprocessing and kernelization. Proc. 2nd IWPEC. LNCS vol. 4639 (2006), Springer 312-321
16. Fellows M.R., Langston M.A., Rosamond F., and Shaw P. Polynomial-time linear kernelization for Cluster Editing. Proc. 16th FCT. LNCS vol. 4169 (2007), Springer 276-277
17. Flum J., and Grohe M. Parameterized Complexity Theory (2006), Springer
18. Giotis I., and Guruswami V. Correlation clustering with a fixed number of clusters. Proc. 17th ACM-SIAM SODA (2006), ACM Press 1167-1176
19. Gramm J., Guo J., Hüffner F., and Niedermeier R. Graph-modeled data clustering: Exact algorithms for clique generation. Theory of Computing Systems 38 4 (2005) 373-392
20. Guo J. A more effective linear kernelization for Cluster Editing. Proc. 1st ESCAPE. LNCS vol. 4614 (2007), Springer 36-47
21. Guo J., and Niedermeier R. Invitation to data reduction and problem kernelization. ACM SIGACT News 38 1 (2007) 31-45
22. Hsu W., and Ma T. Substitution decomposition on chordal graphs and applications. Proc. 2nd International Symposium on Algorithms. LNCS vol. 557 (1991), Springer 52-60
23. Křivánek M., and Morávek J. NP-hard problems in hierarchical-tree clustering. Acta Informatica 23 3 (1986) 311-323
24. Lin G., Kearney P.E., and Jiang T. Phylogenetic k-root and Steiner k-root. Proc. 11th ISAAC. LNCS vol. 1969 (2000), Springer 539-551
25. Niedermeier R. Invitation to Fixed-parameter Algorithms (2006), Oxford University Press
26. Protti F., da Silva M.D., and Szwarcfiter J.L. Applying modular decomposition to parameterized bicluster editing. Proc. 2nd IWPEC. LNCS vol. 4169 (2006), Springer 1-12 Long version to appear in Theory of Computing Systems
27. Shamir R., Sharan R., and Tsur D. Cluster graph modification problems. Discrete Applied Mathematics 144 (2004) 173-182