The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs

Theoretical Computer Science

Volumn 244, Issue 1-2, 2000, Pages 167-188

  Bodlaender, Hans L ^a   Fellows, Michael R ^b   Hallett, Michael T ^c   Wareham, H Todd ^d   Warnow, Tandy J ^e  

^a UTRECHT UNIVERSITY   (Netherlands)

^b UNIVERSITY OF VICTORIA   (Canada)

^c ETH ZURICH   (Switzerland)

^d MCMASTER UNIVERSITY   (Canada)

^e UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Complexity; Fixed parameter intractability; Graph problems; Triangulation of colored graphs

Indexed keywords

EID: 0344412409     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00342-9     Document Type: Article

References (51)

1. K. Abrahamson, M.R. Fellows, Finite automata, bounded treewidth and well-quasiordering, Contemp. Math. 147 (1993) 539-563.
2. R. Agarwala, D. Fernández-Baca, A polynomial-time algorithm for the perfect phylogeny problem when the number of character-states is fixed, SIAM J. Comput. 23 (6) (1994) 1216-1224.
3. R. Agarwala, D. Fernández-Baca, Fast and simple algorithms for perfect phylogeny and triangulating colored graphs, Internat. J. Found. Comput. Sci. 7 (1) (1996) 11-22.
4. A.V. Aho, J.D. Ullman, Optimization of straight line programs, SIAM J. Comput. 1 (1972) 1-19.
5. S. Arnborg, Efficient algorithms for combinatorial problems on graphs with bounded decomposability: a survey, BIT 25 (1985) 2-23.
6. H.L. Bodlaender, Dynamic programming algorithms on graphs with bounded tree-width, in: Proc. 15th Internat. Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 317, Springer, Berlin, 1998, pp. 105-119.
7. H.L. Bodlaender, A linear time algorithm for finding tree-decompositions of small treewidth, SIAM J. Comput. 25 (1996) 1305-1317.
8. H.L. Bodlaender, R.G. Downey, M.R. Fellows, H.T. Wareham, The parameterized complexity of sequence alignment and consensus, Theoret. Comput. Sci. 147 (1995) 31-54.
9. H.L. Bodlaender, B. de Fluiter, Intervalizing k-colored graphs, in: Proc. 22nd Internat. Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 944, Springer, Berlin, 1995, pp. 87-98.
10. H.L. Bodlaender, M.R. Fellows, M.T. Hallett, Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy, in: Proc. 26th Annu. ACM Symp. on the Theory of Computing, 1994, pp. 449-458.
11. H.L. Bodlaender, M.R. Fellows, T.J. Warnow, Two strikes against perfect phylogeny, in: Proc. 19th Internat. Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 623, Springer, Berlin, 1992, pp. 373-383.
12. H.L. Bodlaender, T. Kloks, Efficient and constructive algorithms for the pathwidth and treewidth of graphs, J. Algorithms, 21 (1996) 358-402.
13. H.L. Bodlaender, R.H. Möhring, The pathwidth and treewidth of cographs, SIAM J. Discrete Math. 6 (1993) 181-188.
14. S.H. Bokhari, A shortest tree algorithm for optimal assignments across space and time in distributed processor systems, IEEE Trans. Software Eng. SE-7 (6) (1981) 583-589.
15. R.B. Borie, R.G. Parker, C.A. Tovey, Automatic generation of linear-time algorithms from predicate calculus and descriptions of problems on recursively constructed graph families, Algorithmica 7 (1992) 555-582.
16. P. Buneman, A characterization of rigid circuit graphs, Discrete Math. 9 (1974) 205-212.
17. L. Cai, J. Chen, R.G. Downey, M.R. Fellows, The parameterized complexity of short computations and factorizations, Technical report, Department of Computer Science, University of Victoria, July 1993.
18. N.G. Cooper (Ed.), The human genome project, Los Alamos Sci. 20 (1992) 119.
19. B. Courcelle, The monadic second-order logic of graphs I: recognizable sets of finite graphs, Inform. and Comput. 85 (1990) 12-75.
20. W.H. Day, D. Sankoff, Computational complexity of inferring phylogenies by compatibility, Systematic Zoology 35 (2) (1986) 224-229.
21. R.G. Downey, P.A. Evans, M.R. Fellows, Parameterized learning complexity, in: Proc. 6th ACM Workshop on Computational Learning Theory (COLT), 1993, pp. 51-57.
22. R.G. Downey, M.R. Fellows, Fixed-parameter intractability (extended abstract), Proc. 7th Annual Conf. on Structure in Complexity Theory (Structures'92), 1992, pp. 36-49.
23. R.G. Downey, M.R. Fellows, Fixed-parameter tractability and completeness III: some structural aspects of the W-hierarchy, in: K. Ambos-Spies, S. Homer, U. Schoning (Eds.), Complexity Theory, Cambridge University Press, Cambridge, 1993, pp. 166-191.
24. R.G. Downey, M.R. Fellows, Fixed-parameter tractability and completeness I: basic results, SIAM J. Comput. 24 (1995) 873-921.
25. R.G. Downey, M.R. Fellows, Fixed parameter tractability and completeness II: on completeness for W[1], Theoret. Comput. Sci. 141 (1995) 109-131.
26. R.G. Downey, M.R. Fellows, B.M. Kapron, M.T. Hallett, H.T. Wareham, The parameterized complexity of some problems in logic and linguistics, in: Proc. Symp. on Logical Foundations of Computer Science (LFCS '94), Lecture notes in Computer Science, vol. 813, Springer, Berlin, 1994, pp. 89-100.
27. G.F. Estabrook, Some concepts for the estimation of evolutionary relationships in systematic botany, Systematic Botany 3 (2) (1978) 146-158.
28. M.R. Fellows, M.T. Hallett, H.T. Wareham, DNA physical mapping: 3 ways difficult, in: Tom Lengauer (Ed.), Proc. 1st Annu. European Symp. on Algorithms (ESA'93), Lecture Notes in Computer Science, vol. 726, Springer, Berlin, pp. 157-168.
29. D. Fernàndez-Baca, Allocating modules to processors in a distributed system, IEEE Trans. Software Eng. 15 (11) (1989) 1427-1436.
30. D. Fernàndez-Baca, A. Medipalli, Parametric module allocation on partial k-trees, IEEE Trans. Computers 42 (1993) 738-742.
31. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
32. M.C. Golumbic, H. Kaplan, R. Shamir, On the complexity of physical mapping, Adv. Appl. Math. 15 (1994) 251-261.
33. E.M. Gurari, I.H. Sudborough, Improved dynamic programming algorithms for bandwidth minimization and the mincut linear arrangement problem, J. Algorithms 5 (1984) 531-546.
34. D. Gusfield, Efficient algorithms for inferring evolutionary trees, Networks 21 (1981) 19-28.
35. M.T. Hallett, H.T. Wareham, A compendium of parameterized results, SIGACT News 25 (3) (1994) 122-123.
36. R. Idury, A. Schaffer, Triangulating three-colored graphs in linear time and linear space, SIAM J. Discrete Math. 2 (1993) 289-293.
37. S. Kannan, T.J. Warnow, Inferring evolutionary history from DNA sequences, in: Proc. 31rd Annu. Symp. on Foundations of Computer Science, 1990, pp. 362-371.
38. S.K. Kannan, T.K. Warnow, Triangulating 3-colored graphs, SIAM J. Discrete Math. 5 (1992) 249-258.
39. S.K. Kannan, T.J. Warnow, Inferring evolutionary history from DNA sequences, SIAM J. Comput. 23 (4) (1994) 713-737.
40. H. Kaplan, R. Shamir, Pathwidth, bandwidth and completion problems to proper interval graphs with small cliques, SIAM J. Comput. 25 (1996) 540-561.
41. H. Kaplan, R. Shamir, R.E. Tarjan, Tractability of parameterized completion problems on chordal and interval graphs, Found Comput. Ser. (1994) 780-791.
42. C.A. Meacham, G.F. Estabrook, Compatibility methods in systematics, Annu. Rev. Ecol. Systematics 16 (1985) 431-446.
43. F.R. McMorris, T.J. Warnow, T. Wimer, Triangulating vertex-colored graphs, SIAM J. Discrete Math. 7 (2) (1994) 296-306.
44. S.-I. Nakano, T. Oguma, T. Nishizeki, A linear time algorithm for c-triangulating three-colored graphs, Trans. Inst. Electron. Inform. Commun. Eng. A 377-A (3) (1994) 543-546 (in Japanese).
45. R. Sethi, Complete register allocation problems, SIAM J. Comput. 4 (1975) 226-248.
46. R. Sethi, J.D. Ullman, The generation of optimal code for arithmetic expressions, J. Assoc. Comput. Mach. 17 (1970) 715-728.
47. M.A. Steel, The complexity of reconstructing trees from qualitative characters and subtrees, J. Classification 9 (1992) 91-116.
48. H. Stone, Critical load factors in two-processor distributed systems, IEEE Trans. Software Eng. SE-4 (1978) 254-258.
49. D. Towsley, Allocating programs containing branches and loops within a multiple processor system, IEEE Trans. Software Eng. SE-12 (10) (1986) 1018-1024.
50. T. Warnow, Combinatorial algorithms for constructing phylogenetic trees, Ph.D. Thesis, University of California, Berkeley, 1991.
51. T.V. Wimer, Linear algorithms on k-terminal graphs, Ph.D. Thesis, Dept. Computer Science, Clemson University, 1987.