Fixed-parameter enumerability of cluster Editing and related problems

Theory of Computing Systems

Volumn 46, Issue 2, 2010, Pages 261-283

  Damaschke, Peter ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

Cluster graphs; Enumeration problems; Fixed parameter tractability; Soft clustering; True twins

Indexed keywords

CLUSTER GRAPHS; ENUMERATION PROBLEMS; FIXED-PARAMETER TRACTABILITY; SOFT CLUSTERING; TRUE TWINS;

POLYNOMIAL APPROXIMATION;

OPTIMIZATION;

EID: 77952882032     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-008-9130-1     Document Type: Article

References (26)

1. Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Mach. Learn. 56, 89-113 (2004).
2. Chen, Z. Z., Jiang, T., Lin, G.: Computing phylogenetic roots with bounded degrees and errors. SIAM J. Comput. 32, 864-879 (2003).
3. Damaschke, P.: Parameterized enumeration, transversals, and imperfect phylogeny reconstruction. Theor. Comput. Sci. 351, 337-350 (2006).
4. Dehne, F., Langston, M. A., Luo, X., Pitre, S., Shaw, P., Zhang, Y.: The cluster editing problem: implementations and experiments. In: 2nd International Workshop on Parameterized and Exact Computation IWPEC. LNCS, vol. 4169, pp. 13-24. Springer, Berlin (2006).
5. Downey, R. G., Fellows, M. R.: Parameterized Complexity. Springer, Berlin (1999).
6. Fernau, H.: On parameterized enumeration. In: 8th Computing and Combinatorics Conference COCOON. LNCS, vol. 2387, pp. 564-573. Springer, Berlin (2002).
7. Fernau, H.: Edge dominating set: efficient enumeration-based exact algorithms. In: 2nd International Workshop on Parameterized and Exact Computation IWPEC. LNCS, vol. 4169, pp. 142-153. Springer, Berlin (2006).
8. Frigui, H., Nasraoui, O.: Simultaneous clustering and dynamic keyword weighting for text documents. In: Berry, M. (ed.) Survey of Text Mining, pp. 45-70. Springer, Berlin (2004).
9. Gramm, J., Guo, J., Hüffner, F., Niedermeier, R.: Automated generation of search tree algorithms for hard graph-modification problems. Algorithmica 39, 321-347 (2004).
10. Gramm, J., Guo, J., Hüffner, F., Niedermeier, R.: Graph-modeled data clustering: fixed-parameter algorithms for clique generation. Theory Comput. Syst. 38, 373-392 (2005).
11. Guo, J.: A more effective linear kernelization for cluster editing. In: 1st Int. Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies ESCAPE. LNCS, vol. 4614, pp. 36-47. Springer, Berlin (2007).
12. Guo, J., Gramm, J., Hüffner, F., Niedermeier, R., Wernicke, S.: Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. J. Comput. Syst. Sci. 72, 1386-1396 (2006).
13. Hsu, W. L., Ma, T. H.: Substitution decomposition on chordal graphs and applications. In: 2nd International Symposium on Algorithms ISA. LNCS, vol. 557, pp. 52-60. Springer, Berlin (1991).
14. Hüffner, F., Komusiewicz, C., Moser, H., Niedermeier, R.: Fixed-parameter algorithms for cluster vertex deletion. In: 8th Latin American Theoretical Informatics Symposium LATIN. LNCS, vol. 4957, pp. 711-722. Springer, Berlin (2008).
15. Krivanek, M., Moravek, J.: NP-hard problems in hierarchical-tree clustering. Acta Inform. 23, 311-323 (1986).
16. Lin, G. H., Jiang, T., Kearney, P. E.: Phylogenetic k-root and Steiner k-root. In: 11th International Symposium on Algorithms and Computation ISAAC. LNCS, vol. 1969, pp. 539-551. Springer, Berlin (2000).
17. Mitchell, T. M.: Machine Learning. McGraw-Hill, New York (1997).
18. Mölle, D., Richter, S., Rossmanith, P.: Enumerate and expand: improved algorithms for connected vertex cover and tree cover. In: 1st International Computer Science Symposium in Russia CSR. LNCS, vol. 3967, pp. 270-280. Springer, Berlin (2006).
19. Mölle, D., Richter, S., Rossmanith, P.: Enumerate and expand: new runtime bounds for vertex cover variant. In: 12th Computing and Combinatorics Conference COCOON. LNCS, vol. 4112, pp. 265-273. Springer, Berlin (2006).
20. Nolander, T.: On the fixed-parameter enumerability of cluster deletion. Master's thesis, Computing Science, Chalmers (Göteborg) (2006).
21. Rahmann, S., Wittkop, T., Baumbach, J., Martin, M., Truß, A., Böcker, S.: Exact and heuristic algorithms for weighted cluster editing. In 6th Annual International Conference on Computational Systems Bioinformatics CSB, pp. 391-401 (2007).
22. Scholtens, D., Vidal, M., Gentleman, R.: Local modeling of global interactome networks. Bioinformatics 21, 3548-3557 (2005).
23. Shamir, R., Sharan, R., Tsur, D.: Cluster graph modification problems. Discrete Appl. Math. 144, 173-182 (2004).
24. Sharan, R., Shamir, R.: Algorithmic approaches to clustering gene expression data. In: Current Topics in Computational Molecular Biology, pp. 269-300. MIT Press, Cambridge (2002).
25. Sharan, R., Maron-Katz, A., Shamir, R.: CLICK and EXPANDER: a system for clustering and visualizing gene expression data. Bioinformatics 19, 1787-1799 (2003).
26. Wu, S., Gu, X.: Gene network: model, dynamics and simulation. In: 11th Computing and Combinatorics Conference COCOON. LNCS, vol. 3595, pp. 12-21. Springer, Berlin (2005).