Graph-modeled data clustering: Exact algorithms for clique generation

Theory of Computing Systems

Volumn 38, Issue 4, 2005, Pages 373-392

  Gramm, Jens ^a   Guo, Jiong ^b   Hüffner, Falk ^b   Niedermeier, Rolf ^b  

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CLIQUE GENERATION; DATA CLUSTERING; GRAPH MODELS; TREE SIZES;

ALGORITHMS; DATA STRUCTURES; EDGE DETECTION; ONLINE SEARCHING; PARAMETER ESTIMATION; POLYNOMIALS; PROBLEM SOLVING; TREES (MATHEMATICS);

GRAPH THEORY;

EID: 22344446469     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-004-1178-y     Document Type: Conference Paper

References (29)

1. J. Alber, M. R. Fellows, and R. Niedermeier. Polynomial-time data reduction for Dominating Set. Journal of the ACM, 51(3):363-384, 2004.
2. J. Alber, J. Gramm, and R. Niedermeier. Faster exact solutions for hard problems: a parameterized point of view. Discrete Mathematics, 229:3-27, 2001.
3. N. Bansal, A. Blum, and S. Chawla. Correlation clustering. Machine Learning, 56(1-3):89-113, 2004.
4. A. Ben-Dor, R. Shamir, and Z. Yakhini. Clustering gene expression patterns. Journal of Computational Biology, 6(3/4):281-297, 1999.
5. L. Cai. Fixed-parameter tractability of graph modification problems for hereditary properties. Information Processing Letters, 58:171-176, 1996.
6. M. Charikar, V. Guruswami, and A. Wirth. Clustering with qualitative information. In Proc. of 44th IEEE FOCS, pages 524-533, 2003.
7. J. Chen, I. Kanj, and W. Jia. Vertex Cover: further observations and further improvements. Journal of Algorithms, 41:280-301, 2001.
8. E. D. Demaine and N. Immorlica. Correlation clustering with partial information. In Proc. of 6th APPROX, pages 1-13. Volume 2764 of LNCS. Springer, Berlin, 2003.
9. R. G. Downey. Parameterized complexity for the skeptic (invited paper). In Proc. of 18th IEEE Conference on Computational Complexity, pages 147-169, 2003.
10. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, New York, 1999.
11. D. Emanuel and A. Fiat. Correlation clustering - minimizing disagreements on arbitrary weighted graphs. In Proc. of 11th ESA, pages 208-220. Volume 2832 of LNCS. Springer, Berlin, 2003.
12. M. R. Fellows. Parameterized complexity: the main ideas and connections to practical computing. In Experimental Algorithmics, pages 51-77. Volume 2547 of LNCS. Springer, Berlin, 2002.
13. M. R. Fellows. New directions and new challenges in algorithm design and complexity, parameterized (invited paper). In Proc. of 8th WADS, pages 505-519. Volume 2748 of LNCS. Springer, Berlin, 2003.
14. J. Gramm, J. Guo, F. Hüffner, and R. Niedermeier. Automated generation of search tree algorithms for hard graph modification problems. Algorithmica, 39:321-347, 2004.
15. P. Hansen and B. Jaumard. Cluster analysis and mathematical programming. Mathematical Programming, 79:191-215, 1997.
16. F. Hüffner. Graph Modification Problems and Automated Search Tree Generation. Diploma Thesis, WSI für Informatik, Universität Tübingen, October 2003.
17. A. K. Jain and R. C. Dubes. Algorithms for Clustering Data. Prentice-Hall, Englewood Cliffs, NJ, 1988.
18. H. Kaplan, R. Shamir, and R. E. Tarjan. Tractability of parameterized completion problems on chordal, strongly chordal, and proper interval graphs. SIAM Journal on Computing, 28(5):1906-1922, 1999.
19. S. Khot and V. Raman. Parameterized complexity of finding subgraphs with hereditary properties. Theoretical Computer Science, 289:997-1008, 2002.
20. M. Křivánek and J. Morávek. NP-hard problems in hierarchical-tree clustering. Acta Informatica, 23(3):311-323, 1986.
21. O. Kullmann. New methods for 3-SAT decision and worst-case analysis. Theoretical Computer Science, 223(1-2):1-72, 1999.
22. M. Mahajan and V. Raman. Parameterizing above guaranteed values: MaxSat and MaxCut. Journal of Algorithms, 31:335-354, 1999.
23. A. Natanzon, R. Shamir, and R. Sharan. Complexity classification of some edge modification problems. Discrete Applied Mathematics, 113:109-128, 2001.
24. R. Niedermeier and P. Rossmanith. Upper bounds for Vertex Cover further improved. In Proc. of 16th STACS, pages 561-570. Volume 1563 of LNCS. Springer, Berlin, 1999.
25. R. Niedermeier and P. Rossmanith. A general method to speed up fixed-parameter-tractable algorithms. Information Processing Letters, 73:125-129, 2000.
26. R. Niedermeier and P. Rossmanith. On efficient fixed-parameter algorithms for Weighted Vertex Cover. Journal of Algorithms, 47(2):63-77, 2003.
27. R. Shamir, R. Sharan, and D. Tsur. Cluster graph modification problems. Discrete Applied Mathematics, 144:173-182, 2004.
28. R. Sharan and R. Shamir. CLICK: A clustering algorithm with applications to gene expression analysis. In Proc. of 8th ISMB, pages 307-316. AAAI Press, Menlo Park, CA, 2000.
29. R. Sharan and R. Shamir. Algorithmic approaches to clustering gene expression data. In T. Jiang et al. (eds): Current Topics in Computational Molecular Biology, pages 269-300. The MIT Press, Cambridge, MA, 2002.