Interval completion with few edges

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2007, Pages 374-381

  Heggernes, Pinar ^a   Paul, Christophe ^b   Telle, Jan Arne ^a   Villanger, Yngve ^a  

^a UNIVERSITY OF BERGEN   (Norway)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

Branching; Edge completion; FPT algorithm; Interval graphs; Physical mapping; Profile minimization

Indexed keywords

EDGE COMPLETION; FPT ALGORITHMS; INTERVAL GRAPHS; PHYSICAL MAPPING; PROFILE MINIMIZATION;

COMPUTATION THEORY; GRAPH THEORY; MATRIX ALGEBRA; OPTIMIZATION; PROBLEM SOLVING;

ALGORITHMS;

EID: 35448959960     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1250790.1250847     Document Type: Conference Paper

References (25)

1. P. Buneman. A characterization of rigid circuit graphs. Discrete Math., 9:205-212, 1974.
2. L. Cai. Fixed-parameter tractability of graph modification problems for hereditary properties. Information Processing Letters, 58(4):171-176, 1996.
3. D. G. Corneil, S. Olariu, and L. Stewart. Asteroidal Triple-Free Graphs. SIAM J. Discrete Math., 10(3):399-430, 1997.
4. J. Díaz, A.M. Gibbons, M.S. Paterson, and J. Torán. The minsumcut problem. In Proceedings WADS 1991, 65-79
5. G. A. Dirac. On rigid circuit graphs. Abh. Math. Sem. Univ. Hamburg, 25:71-76, 1961.
6. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer Verlag, New York, 1999.
7. G. Even, J. Naor, S. Rao, and B. Scheiber. Divide-and-conquer approximation algoeirhtms via spreading metrics. In Proceedings FOCS 1995, 62-71.
8. M. Garey and D. Johnson. Computers and intractability: a guide to the theory of NP-completeness W.H.Freeman and co, San Fransisco, 1979.
9. J. A. George and J. W. H. Liu. Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall Inc., Englewood Cliffs, New Jersey, 1981.
10. P. C. Gilmore and A. J. Hoffman. A characterization of comparability graphs and of interval graphs. Canadian Journal of Mathematics, 16:539-548, 1964.
11. P. W. Goldberg, M. C. Golumbic, H. Kaplan, and R. Shamir. Four strikes against physical mapping of DNA. J. Comput. Bio., 2(1): 139-152, 1995.
12. M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Second edition. Annals of Discrete Mathematics 57. Elsevier, 2004.
13. G. Gutin, S. Szeider, and A. Yeo. Fixed-parameter complexity of minimum profile problems. In Proceedings IWPEC 2006, pages 60-71, 2006. Springer LNCS 4169.
14. 2.376). SIAM Journal on Discrete Mathematics, 19-4:900 - 913, 2005. In Proceedings SODA 2005, pages 907-916, 2005.
15. P. Heggernes, K. Suchan, I. Todinca, and Y. Villanger. Minimal interval completions. In Proceedings ESA 2005, pages 403-414, 2005. Springer LNCS 3669.
16. H. Kaplan, R. Shamir, and R. E. Tarjan. Tractability of parameterized completion problems on chordal and interval graphs: minimum fill-in and physical mapping. In Proceedings FOCS 1994, 780-791.
17. H. Kaplan, R. Shamir, and R. E. Tarjan. Tractability of parameterized completion problems on chordal, strongly chordal, and proper interval graphs. SIAM J. Comput., 28(5):1906-1922, 1999.
18. T. Kashiwabara, and T. Fujisawa. An NP-complete problem on interval graphs. IEEE Symp. of Circuits and Systems, pages 82-83, 1979.
19. D. Kratsch, R. McConnell, K. Mehlhorn, and J. Spinrad. Certifying algorithms for recognizing interval graphs and permutation graphs In Proceedings SODA 2003, 158-167.
20. D. Kuo, and G.J. Chang. The profile minimization problem in trees. SIAM J. Comput. 23, 71-81, 1994
21. C. G. Lekkerkerker and J. C. Boland. Representation of a finite graph by a set of intervals on the real line. Fund. Math., 51:45-64, 1962.
22. S. Rao and A. Richa. New approximation techniques for some linear ordering problems. SIAM J. Comput. 34(2):388-404 (2004)
23. R. Ravi, A. Agrawal, and P. Klein. Ordering problems approximated: single processor scheduling and interval graph completion. In Proceedings ICALP 1991 751-762, 1991
24. M. Serna and D. Thilikos. Parameterized complexity for graph layout problems. Bulletin of the EATCS, 86:41-65, 2005.
25. R. E. Tarjan. Graph theory and Gaussian elimination. In Sparse Matrix Computations (eds. J. R. Bunch and D. J. Rose). Academic Press, 1976.