A more effective linear kernelization for cluster editing

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

Volumn 4614 LNCS, Issue , 2007, Pages 36-47

  Guo, Jiong ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; INTEGER PROGRAMMING; PROBLEM SOLVING;

CLUSTER EDITING; LINEAR KERNELIZATION;

CLUSTER ANALYSIS;

EID: 38049088998     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74450-4_4     Document Type: Conference Paper

References (22)

1. Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: ranking and clustering. In: Proc. 37th ACM STOC, pp. 684-693. ACM Press, New York (2005)
2. Alber, J., Fellows, M.R., Niedermeier, R.: Polynomial time data reduction for Dominating Set. Journal of the ACM 51(3), 363-384 (2004)
3. Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Machine Learning 56(1), 89-113 (2004)
4. Ben-Dor, A., Shamir, R., Yakhini, Z.: Clustering gene expression patterns. Journal of Computational Biology 6(3/4), 281-297 (1999)
5. Charikar, M., Guruswami, V., Wirth, A.: Clustering with qualitative information. Journal of Computer and System Sciences 71(3), 360-383 (2005)
6. Chen, J., Fernau, H., Kanj, I.A., Xia, G.: Parametric duality and kernelization: Lower bounds and upper bounds on kernel size. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 269-280. Springer, Heidelberg (2005)
7. Chen, Z.-Z., Jiang, T., Lin, G.: Computing phylogenetic roots with bounded degrees and errors. SIAM Journal on Computing 32(4), 864-879 (2003)
8. Dehne, F., Langston, M.A., Luo, X., Pitre, S., Shaw, P., Zhang, Y.: The Cluster Editing problem: Implementations and experiments. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 13-24. Springer, Heidelberg (2006)
9. Dom, M., Guo, J., Hüffner, F., Niedermeier, R.: Extending the tractability border for closest leaf powers. In: Kratsch, D. (ed.) WG 2005. LNCS, vol. 3787, pp. 397-408. Springer, Heidelberg (2005)
10. Dom, M., Guo, J., Hüffner, F., Niedermeier, R.: Error compensation in leaf power problems. Algorithmica 44(4), 363-381 (2006)
11. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
12. Fellows, M.R.: The lost continent of polynomial time: Preprocessing and kernelization. In: Bodlaender, H.L., Langston, MA. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 276-277. Springer, Heidelberg (2006)
13. Fellows, M.R., Langston, M.A., Rosamond, F., Shaw, P.: Polynomial-time linear kernelization for Cluster Editing. Manuscript (2006)
14. Giotis, I., Guruswami, V.: Correlation clustering with a fixed number of clusters. In: Proc. 17th ACM-SIAM SODA, pp. 1167-1176. ACM Press, New York (2006)
15. Gramm, J., Guo, J., Hüffner, F., Niedermeier, R.: Graph-modeled data clustering: Exact algorithms for clique generation. Theory of Computing Systems 38(4), 373-392 (2005)
16. Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. ACM SIGACT News 38(1), 31-45 (2007)
17. Hsu, W., Ma, T.: Substitution decomposition on chordal graphs and applications. In: Hsu, W.-L., Lee, R.C.T. (eds.) ISA 1991. LNCS, vol. 557, pp. 52-60. Springer, Heidelberg (1991)
18. Křivánek, M., Morávek, J.: NP-hard problems in hierarchical-tree clustering. Acta Informatica 23(3), 311-323 (1986)
19. Lin, G., Kearney, P.E., Jiang, T.: Phylogenetic k-root and Steiner k-root. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol. 1969, pp. 539-551. Springer, Heidelberg (2000)
20. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)
21. Protti, F., da Silva, M.D., Szwarcfiter, J.L.: Applying modular decomposition to parameterized bicluster editing. In: Bodlaender, H.L., Langston, M.A. (eds.) IW-PEC 2006. LNCS, vol. 4169, pp. 1-12. Springer, Heidelberg (2006)
22. Shamir, R., Sharan, R., Tsur, D.: Cluster graph modification problems. Discrete Applied Mathematics 144, 173-182 (2004)