Hans L. Bodlaender, Michael R. Fellows, Michael T. Hallett, H. Todd Wareham, Tandy J. Warnow  Home/Search
Context
Related
| cs.uu.nl/pub/RUU/CS/tec...199536.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.uu.nl/~hansb/mypapers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper, we consider the complexity of a number of combinatorial problems; namely, Intervalizing Colored Graphs (DNA physical mapping), Triangulating Colored Graphs (perfect phylogeny), (Directed) (Modified) Colored Cutwidth, Feasible Register Assignment and Module Allocation for graphs of bounded treewidth. Each of these problems has as a characteristic a uniform upper bound on the tree or path width of the graphs in "yes"-instances. For all of these problems with the exceptions of... (Update)
Similar documents (at the sentence level):
79.4%: The Hardness of Problems on Thin Colored Graphs - Bodlaender, Fellows.. (1995) (Correct)
61.0%: The Hardness of Perfect Phylogeny, Feasible.. - Bodlaender.. (Correct)
9.8%: Beyond NP-Completeness for Problems of Bounded Width.. - Bodlaender, Fellows.. (1994) (Correct)
Active bibliography (related documents): More All
0.5: On the Algorithmic Tractability of Single Nucleotide.. - Wernicke (2003) (Correct)
0.5: On Intervalizing k-Colored Graphs for DNA Physical Mapping - Bodlaender, de Fluiter (1995) (Correct)
0.5: Parameterized Complexity Analysis in Computational.. - Bodlaender, Downey.. (1995) (Correct)
Similar documents based on text: More All
1.4: Two Strikes Against Perfect Phylogeny - Bodlaender, Fellows, Warnow (1992) (Correct)
0.6: The Parameterized Complexity of Sequence Alignment.. - Bodlaender, Downey.. (1995) (Correct)
0.5: Compendium of Parameterized Problems - Cesati (2001) (Correct)
BibTeX entry: (Update)
@article{ bfhww,
author = {Hans L. Bodlaender and Michael R. Fellows and Michael T. Hallett
and H. Todd Wareham and Tandy J. Warnow},
title = {The hardness of perfect phylogeny, feasible register assignment and
other problems on thin colored graphs},
journal = {Theoretical Computer Science}, volume = 244, pages = {167-188}, year = 2000,
url = {citeseer.ist.psu.edu/article/bodlaender00hardness.html} }
Citations (may not include all citations):488 Algorithmic Graph Theory and Perfect Graphs (context) - Golumbic - 1980
222 Fixed-parameter tractability and completeness - Downey, Fellows - 1992
222 Fixed-parameter tractability and completeness I: Basic resul.. - Downey, Fellows - 1995
202 A linear time algorithm for finding tree-decompositions of s.. - Bodlaender - 1993
109 Efficient algorithms for combinatorial problems on graphs wi.. (context) - Arnborg - 1985
89 Computational complexity of inferring phylogenies by compati.. (context) - Day, Sankoff - 1986
83 The complexity of reconstructing trees from qualitative char.. (context) - Steel - 1992
66 The generation of optimal code for arithmetic expressions (context) - Sethi, Ullman - 1970
65 The pathwidth and treewidth of cographs - Bodlaender, Mohring - 1993
64 The monadic second-order logic of graphs I: Recognizable set.. (context) - Courcelle - 1990
54 Complete register allocation problems (context) - Sethi - 1975
54 Two Strikes against Perfect Phylogeny - Bodlaender, Fellows et al. - 1992
43 Beyond NP-completeness for problems of bounded width: Hardne.. - Bodlaender, Fellows et al. - 1994
42 A characterization of rigid circuit graphs (context) - Buneman - 1974
42 Automatic generation of linear-time algorithms from predicat.. (context) - Borie, Parker et al. - 1992
40 Fixed parameter intractability (context) - Downey, Fellows - 1992
40 Phylogeny reconstruction (context) - Swofford, Olsen - 1990
36 Bounded Treewidth and WellQuasiordering (context) - Abrahamson, Fellows - 1993
32 Dynamic programming algorithms on graphs with bounded treewi.. (context) - Bodlaender - 1988
29 the complexity of DNA physical mapping - Golumbic, Kaplan et al. - 1994
28 The parameterized complexity of short computations and facto.. (context) - Cai, Chen et al. - 1993
28 A polynomial-time algorithm for the perfect phylogeny proble.. - Agarwala, Fern'andez-Baca - 1994
27 A shortest tree algorithm for optimal assignments across spa.. (context) - Bokhari - 1981
27 The parameterized complexity of some problems in logic and l.. - Downey, Fellows et al. - 1994
27 Efficient algorithms for inferring evolutionary trees (context) - Gusfield - 1991
25 Fixed-parameter tractability of graph modification problems .. (context) - Cai - 1995
25 The parameterized complexity of sequence alignment and conse.. - Bodlaender, Downey et al. - 1995
23 Parameterized complexity analysis in computational biology - Bodlaender, Downey et al. - 1995
22 Allocating programs containing branches and loops within a m.. (context) - Towsley - 1986
22 Inferring Evolutionary History from DNA sequences (context) - Kannan, Warnow - 1994
22 Triangulating vertex-colored graphs (context) - McMorris, Warnow et al. - 1994
20 Parameterized learning complexity (context) - Downey, Evans et al. - 1993
19 Linear algorithms on k-terminal graphs (context) - Wimer - 1987
19 Improved dynamic programming algorithms for bandwidth minimi.. (context) - Gurari, Sudborough - 1984
17 A fast algorithm for the computation and enumeration of perf.. - Kannan, Warnow - 1995
13 the computational complexity of inferring evolutionary trees - Wareham - 1993
9 Combinatorial algorithms for constructing phylogenetic trees (context) - Warnow - 1991
9 Triangulating three-colored graphs in linear time and linear.. (context) - Idury, Schaffer - 1993
8 Annual Review of Ecology and Systematics (context) - Meacham, Estabrook et al. - 1985
8 Triangulating 3-colored graphs (context) - Kannan, Warnow - 1992
7 Critical load factors in two-processor distributed systems (context) - Stone - 1978
7 Combinatoric strategies for genome mapping (context) - Evans - 1991
5 A linear time algorithm for c-triangulating three-colored gr.. (context) - Nakano, Oguma et al. - 1994
4 Some concepts for the estimation of evolutionary relationshi.. (context) - Estabrook - 1978
4 Allocating modules to processors in a distributed system (context) - Fernandez-Baca - 1989
4 Parametric module allocation on partial k-trees (context) - Fernandez-Baca, Medipalli - 1993
3 Optimization of straight line programs (context) - Aho, Ullman - 1972
3 The human genome project (context) - Cooper - 1992
3 DNA Physical Mapping: 3 Ways Difficult (context) - Fellows, Hallett et al.
3 A Compendium of Parameterized Results (context) - Hallett, Wareham - 1994
3 Computer-assisted sequencing (context) - Jungck, Dick et al. - 1982
2 Phylogenies from Molecular Sequences: Inference and Reliabil.. (context) - Felsentein - 1988
Documents on the same site (http://www.cs.uu.nl/~hansb/mypapers.html): More
Linear-Time Register Allocation for a Fixed Number of.. - Bodlaender, Gustedt, Telle (1997) (Correct)
A Tourist Guide through Treewidth - Bodlaender (1993) (Correct)
Efficient and Constructive Algorithms for the Pathwidth and.. - Bodlaender, Kloks (1993) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC