Graph-modeled data clustering: Fixed-parameter algorithms for clique generation

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

Volumn 2653, Issue , 2003, Pages 108-119

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

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

Data clustering; Edge modification problems; Exact algorithms; Fixed parameter tractability; NP complete problems

Indexed keywords

ALGORITHMS; CLUSTER ANALYSIS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; PARAMETER ESTIMATION; PROBLEM SOLVING;

BOUNDED SEARCH; CLUSTER EDITING; DATA CLUSTERING; EDGE MODIFICATION PROBLEMS; EXACT ALGORITHMS; FIXED-PARAMETER ALGORITHMS; FIXED-PARAMETER TRACTABILITY; VERTEX DISJOINT;

CLUSTERING ALGORITHMS;

EID: 21144458443     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44849-7_17     Document Type: Article

References (19)

1. J. Alber, J. Gramm, and R. Niedermeier. Faster exact solutions for hard problems: a parameterized point of view. Discrete Mathematics, 229:3-27, 2001.
2. A. Ben-Dor, R. Shamir, and Z. Yakhini. Clustering gene expression patterns. Journal of Computational Biology, 6(3/4):281-297, 1999.
3. Leizhen Cai. Fixed-parameter tractability of graph modification problems for hereditary properties. Information Processing Letters, 58:171-176, 1996.
4. J. Chen, I. Kanj, and W. Jia Vertex cover: further observations and further improvements. Journal of Algorithms, 41:280-301, 2001.
5. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer. 1999.
6. M. R. Fellows. Parameterized complexity: the main ideas and connections to practical computing. In Experimental Algorithmics, number 2547 in LNCS, pages 51-77, 2002. Springer.
7. J. Gramm, J. Guo, F. Hüffner, and R. Niedermeier. Automated generation of search tree algorithms for graph modification problems. Manuscript in preparation, March 2003.
8. P. Hansen and B. Jaumard. Cluster analysis and mathematical programming. Mathematical Programming, 79:191-215, 1997.
9. A. K. Jain and R. C. Dubes. Algorithms for clustering data. Prentice Hall, 1988.
10. 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.
11. S. Khot and V. Raman. Parameterized complexity of finding subgraphs with hereditary properties. Theoretical Computer Science, 289:997-1008, 2002.
12. O. Kullmann. New methods for 3-SAT decision and worst-case analysis. Theoretical Computer Science, 223(1-2):1-72, 1999.
13. M. Mahajan and V. Raman. Parameterizing above guaranteed values: MaxSat and MaxCut. Journal of Algorithms, 31:335-354, 1999.
14. A. Natanzon, R. Shamir, and R. Sharan. Complexity classification of some edge modification problems. Discrete Applied Mathematics, 113:109-128, 2001.
15. R. Niedermeier and P. Rossmanith. A general method to speed up fixed-parameter-tractable algorithms. Information Processing Letters, 73:125-129, 2000.
16. R. Niedermeier and P. Rossmanith. On efficient fixed-parameter algorithms for Weighted Vertex Cover. Journal of Algorithms, to appear, 2003.
17. R. Shamir, R. Sharan, and D. Tsur. Cluster graph modification problems. In Proc. of 28th WG, number 2573 in LNCS, pages 379-390, 2002, Springer.
18. R. Sharan and R. Shamir. CLICK: A clustering algorithm with applications to gene expression analysis. In Proc. of 8th ISMB, pp. 307-316, 2000. AAAI Press.
19. 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. 2002.