메뉴 건너뛰기




Volumn 3787 LNCS, Issue , 2005, Pages 283-294

On the fixed-parameter enumerability of cluster editing

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATABASE SYSTEMS; PROBLEM SOLVING;

EID: 33744927172     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11604686_25     Document Type: Conference Paper
Times cited : (6)

References (18)
  • 2
    • 0141645254 scopus 로고    scopus 로고
    • Computing phylogenetic roots with bounded degrees and errors
    • Z.Z. Chen, T. Jiang, G. Lin. Computing phylogenetic roots with bounded degrees and errors, SIAM J. Comp. 32 (2003), 864-879
    • (2003) SIAM J. Comp. , vol.32 , pp. 864-879
    • Chen, Z.Z.1    Jiang, T.2    Lin, G.3
  • 4
    • 36649023966 scopus 로고    scopus 로고
    • Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
    • [6], journal version accepted for a special issue of
    • P. Damaschke. Parameterized enumeration, transversals, and imperfect phylogeny reconstruction. In [6], 1-12, journal version accepted for a special issue of Theoretical Computer Science
    • Theoretical Computer Science , pp. 1-12
    • Damaschke, P.1
  • 6
    • 33744900046 scopus 로고    scopus 로고
    • R.G. Downey, M.R. Fellows, F. Dehne (eds.). Parameterized and Exact Computation, 1st Int. Workshop IWPEC'2004, Proceedings
    • R.G. Downey, M.R. Fellows, F. Dehne (eds.). Parameterized and Exact Computation, 1st Int. Workshop IWPEC'2004, Proceedings, LNCS 3162
    • LNCS , vol.3162
  • 8
    • 84949773604 scopus 로고    scopus 로고
    • On parameterized enumeration
    • H. Fernau. On parameterized enumeration, 8th COCOON'2002, LNCS 2387, 564-573
    • 8th COCOON'2002, LNCS , vol.2387 , pp. 564-573
    • Fernau, H.1
  • 10
    • 33744903339 scopus 로고    scopus 로고
    • preliminary version in
    • preliminary version in 5th CIAC'2003, LNCS 2653, 108-119
    • 5th CIAC'2003, LNCS , vol.2653 , pp. 108-119
  • 11
    • 21044455172 scopus 로고    scopus 로고
    • Automated generation of search tree algorithms for hard graph-modification problems
    • J. Gramm, J. Guo, F. Hüffner, R. Niedermeier. Automated generation of search tree algorithms for hard graph-modification problems, Algorithmica 39 (2004), 321-347
    • (2004) Algorithmica , vol.39 , pp. 321-347
    • Gramm, J.1    Guo, J.2    Hüffner, F.3    Niedermeier, R.4
  • 12
    • 0002885928 scopus 로고
    • Combinatorial relations and chromatic graphs
    • R.E. Greenwood, A.M. Gleason. Combinatorial relations and chromatic graphs, Canad J. Math. 7 (1955), 1-7
    • (1955) Canad J. Math. , vol.7 , pp. 1-7
    • Greenwood, R.E.1    Gleason, A.M.2
  • 16
    • 33744934180 scopus 로고    scopus 로고
    • preliminary version in
    • preliminary version in: 28th WG'2002, LNCS 2573, 379-390
    • 28th WG'2002, LNCS , vol.2573 , pp. 379-390
  • 17
    • 0141506116 scopus 로고    scopus 로고
    • CLICK and EXPANDER: A system for clustering and visualizing gene expression data
    • R. Sharan, A. Maron-Katz, R. Shamir. CLICK and EXPANDER: A system for clustering and visualizing gene expression data, Bioinformatics 19 (2003), 1787-1799
    • (2003) Bioinformatics , vol.19 , pp. 1787-1799
    • Sharan, R.1    Maron-Katz, A.2    Shamir, R.3


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