메뉴 건너뛰기




Volumn 4169 LNCS, Issue , 2006, Pages 1-12

Applying modular decomposition to parameterized bicluster editing

Author keywords

Bicluster graphs; Cluster graphs; Edge modification problems; Fixed parameter tractability; NP complete problems

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; SET THEORY; TREES (MATHEMATICS);

EID: 33750262659     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11847250_1     Document Type: Conference Paper
Times cited : (16)

References (19)
  • 2
    • 0020752203 scopus 로고
    • A fast algorithm for the decomposition of graphs and posets
    • Bauer, H. and Möhring, R. H. A fast algorithm for the decomposition of graphs and posets. Mathematics of Operations Research 8 (1983) 170-184.
    • (1983) Mathematics of Operations Research , vol.8 , pp. 170-184
    • Bauer, H.1    Möhring, R.H.2
  • 4
    • 0000971678 scopus 로고    scopus 로고
    • Fixed-parameter tractability of graph modification problems for hereditary properties
    • Cai, L. Fixed-parameter tractability of graph modification problems for hereditary properties. Information Processing Letters 58 (1996) 171-176.
    • (1996) Information Processing Letters , vol.58 , pp. 171-176
    • Cai, L.1
  • 5
    • 0012657153 scopus 로고    scopus 로고
    • Efficient and practical algorithms for sequential modular decomposition
    • Dahlhaus, E., Gustedt, J., McConnel, R. M. Efficient and practical algorithms for sequential modular decomposition. Journal of Algorithms 41 (2001) 360-387.
    • (2001) Journal of Algorithms , vol.41 , pp. 360-387
    • Dahlhaus, E.1    Gustedt, J.2    McConnel, R.M.3
  • 6
    • 0000134883 scopus 로고
    • Fixed-parameter tractability and completeness I: Basic results
    • Downey, R. G. and Fellows, M. R. Fixed-parameter tractability and completeness I: Basic results. SIAM Journal on Computing 24,4 (1995) 873-921.
    • (1995) SIAM Journal on Computing , vol.24 , Issue.4 , pp. 873-921
    • Downey, R.G.1    Fellows, M.R.2
  • 7
    • 0029290085 scopus 로고
    • Fixed-parameter tractability and completeness II: On completeness for W[1]
    • Downey, R. G. and Fellows, M. R. Fixed-parameter tractability and completeness II: On completeness for W[1]. Theoretical Computer Science 141 (1995) 109-131.
    • (1995) Theoretical Computer Science , vol.141 , pp. 109-131
    • Downey, R.G.1    Fellows, M.R.2
  • 10
    • 0002521124 scopus 로고
    • Transitiv orientierbare graphen
    • Gallai, T. Transitiv orientierbare graphen. Acta Math. Acad. Sci. Hungar. 18 (1967) 26-66.
    • (1967) Acta Math. Acad. Sci. Hungar. , vol.18 , pp. 26-66
    • Gallai, T.1
  • 11
    • 22344446469 scopus 로고    scopus 로고
    • Graph-modeled data clustering: Fixed-parameter algorithms for clique generation
    • Gramm, J., Guo, J., Hüffner, F., Niedermeier, R. Graph-modeled data clustering: Fixed-parameter algorithms for clique generation. Theory of Computing Systems 38,4 (2005) 373-392.
    • (2005) Theory of Computing Systems , vol.38 , Issue.4 , pp. 373-392
    • Gramm, J.1    Guo, J.2    Hüffner, F.3    Niedermeier, R.4
  • 12
    • 21044455172 scopus 로고    scopus 로고
    • Automated generation of search tree algorithms for hard graph modification problems
    • Gramm, J., Guo, J., Hüffner, F., Niedermeier, R. Automated generation of search tree algorithms for hard graph modification problems. Algorithmica 39,4 (2004) 321-347.
    • (2004) Algorithmica , vol.39 , Issue.4 , pp. 321-347
    • Gramm, J.1    Guo, J.2    Hüffner, F.3    Niedermeier, R.4
  • 14
    • 0000055363 scopus 로고
    • Substitution decomposition and connections with combinatorial optimization
    • Möhring, R. H. and Radermacher, F. J. Substitution decomposition and connections with combinatorial optimization. Ann. Discrete Math. 19 (1984) 257-356.
    • (1984) Ann. Discrete Math. , vol.19 , pp. 257-356
    • Möhring, R.H.1    Radermacher, F.J.2
  • 17
    • 4544362724 scopus 로고    scopus 로고
    • Complexity classification of some edge modification problems
    • Natanzon, A., Shamir, R., Sharan, R. Complexity classification of some edge modification problems, Discrete Applied Mathematics 113 (1999) 109-128.
    • (1999) Discrete Applied Mathematics , vol.113 , pp. 109-128
    • Natanzon, A.1    Shamir, R.2    Sharan, R.3
  • 18
    • 0033874612 scopus 로고    scopus 로고
    • A general method to speed up fixed-parameter-tractable algorithms
    • Niedermeier, R. and Rossmanith, P. A general method to speed up fixed-parameter-tractable algorithms. Information Processing Letters 73 (2000) 125-129.
    • (2000) Information Processing Letters , vol.73 , pp. 125-129
    • Niedermeier, R.1    Rossmanith, P.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.