The cluster editing problem: Implementations and experiments

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

Volumn 4169 LNCS, Issue , 2006, Pages 13-24

  Dehne, Frank ^a   Langston, Michael A ^b   Luo, Xuemei ^a   Pitre, Sylvain ^a   Shaw, Peter ^c   Zhang, Yun ^b  

^a CARLETON UNIVERSITY   (Canada)

^b University of Tennessee Knoxville   (United States)

^c UNIVERSITY OF NEWCASTLE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR PROGRAMMING; PROBLEM SOLVING;

CLUSTER EDITING; MONOTONICITY;

ARTIFICIAL INTELLIGENCE;

EID: 33750278534     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11847250_2     Document Type: Conference Paper

References (10)

1. F. N. Abu-Khzam, R. L. Collins, M. R. Fellows, M. A. Langston, W. H. Suters, and C. T. Symons. Kernelization algorithms for the vertex cover problem: Theory and experiments. In Proceedings, Workshop on Algorithm Engineering and Experiments, New Orleans, Louisiana, 2004.
2. F. N. Abu-Khzam, M. A. Langsten, P. Shanbhag, and C. T. Symons. Scalable parallel algorithms for FPT problems. Algorithmica, 2006, accepted for publication.
3. M. Charikar, V. Guruswami, and A. Wirth. Clustering with qualitative information. Journal of Computer and System Sciences, 71:360-383, 2005.
4. P. Damaschke. On the fixed-parameter enumerability of cluster editing. In Proceedings, International Workshop on Graph-Theoretic Concepts in Computer Science, pages 283-294, 2005.
5. P. Damaschke. Fixed-parameter tractable generalizations of cluster editing. In Proceedings, International Conference on Algorithms and Complexity, 2006.
6. J. Gramm, J. Guo, F. Hueffner, and R. Niedermeier. Graph-modeled data clustering: Fixedparameter algorithms for clique generation. Theory of Computing Systems, 38(4):373 - 392, 2005.
7. J. Guo. Algorithm design techniques for parameterized graph modification problems. PhD thesis, Univ. Jena, 2005.
8. Edith Hemaspaandra, Jörg Rothe, and Holger Spakowski. Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to np. In WG, pages 258-269, 2002.
9. D. E. Knuth. The Art of Computer Programming, volume 2: Seminumerical algorithms. Addison-Wesley, 3 edition, 1997.
10. Y. Zhang, F. N. Abu-Khzam, N. E. Baldwin, E. J. Chesler, M. A. Langsten, and N. F. Samatova. Genome-scale computational approaches to memory-intensive applications in systems biology. In Proceedings, Supercomputing, Seattle, Washington, 2005.