Fixed-parameter complexity of minimum profile problems

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

Volumn 4169 LNCS, Issue , 2006, Pages 60-71

  Gutin, Gregory ^a,b   Szeider, Stefan ^c   Yeo, Anders ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b UNIVERSITY OF HAIFA   (Israel)

^c DURHAM UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING;

CONNECTED GRAPH; PARAMETERIZATION; SUBGRAPHS;

GRAPH THEORY;

EID: 33750270296     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11847250_6     Document Type: Conference Paper

References (12)

1. A. Billionnet, On interval graphs and matrix profiles. RAIRO Tech. Oper. 20 (1986), 245-256.
2. H.L. Bodlaender, R.G. Downey, M.R. Fellows, M.T. Hallett and H.T. Wareham, Parameterized complexity analysis in computational biology. Comput. Appl. Biosci. 11 (1995), 49-57.
3. J. Diaz, A. Gibbons, M. Paterson and J. Toran, The minsumcut problem. Lect. Notes Comput. Sci. 519 (1991), 65-79.
4. F.V. Fomin and P.A. Golovach, Graph searching and interval completion. SIAM J. Discrete Math. 13 (2000), 454-464.
5. M. R. Garey and D. R. Johnson, Computers and Intractability, Freeman, 1979.
6. P.W. Goldberg, M.C. Golumbic, H. Kaplan and R. Shamir, Four strikes against physical mapping of DNA. J. Comput. Biol. 2 (1995), 139-152.
7. G. Gutin, A. Rafiey, S. Szeider and A. Yeo, The Linear Arrangement Problem Parameterized Above Guaranteed Value. To appear in Theory of Comput. Systems.
8. R.M. Karp, Mapping the genome: some combinatorial problems arising in molecular biology. In Proc. 25th Annual Symp. Theory Comput. (1993), 278-285.
9. D.G. Kendall, Incidence matrices, interval graphs, and seriation in archeology. Pacific J. Math. 28 (1969), 565-570.
10. Y. Lin and J. Yuan, Profile minimization problem for matrices and graphs. Acta Math. Appl. Sinica, English-Series, Yingyong Shuxue-Xuebas 10 (1994), 107-112.
11. M. Serna and D.M. Thilikos, Parameterized complexity for graph layout problems. EATCS Bulletin 86 (2005), 41-65.
12. D.B. West, Introduction to Graph Theory, Prentice Hall, 2001.