Minimal interval completions

Lecture Notes in Computer Science

Volumn 3669, Issue , 2005, Pages 403-414

  Heggernes, Pinar ^a   Suchan, Karol ^b   Todinca, Ioan ^b   Villanger, Yngve ^a  

^a UNIVERSITY OF BERGEN   (Norway)

^b UNIVERSITÉ D'ORLÉANS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

ARBITRARY GRAPHS; INTERVAL COMPLETION; INTERVAL GRAPH; POLYNOMIAL TIME ALGORITHMS;

GRAPH THEORY;

EID: 27144436191     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11561071_37     Document Type: Conference Paper

References (14)

1. A. Berry, P. Heggernes, and Y. Villanger. A vertex incremental approach for dynamically maintaining chordal graphs. In Algorithms and Computation - ISAAC 2003, pages 47-57. Springer Verlag, 2003. LNCS 2906.
2. V. Bouchitté and I. Todinca. Treewidth and minimum fill-in: grouping the minimal separators. SIAM J. on Computing, 31(1):212-232, 2001.
3. M. R. Garey and D. S. Johnson. Computers and Intractability. W. H. Freeman and Co., 1978.
4. P. C. Gilmore and A. J. Huffman. A characterization of comparability graphs and of interval graphs. Canadian J. Math., 16:539-548, 1964.
5. M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, 1980.
6. 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.
7. J. Gustedt. On the pathwidth of chordal graphs. Discrete Applied Mathematics, 45(3):233-248, 2003.
8. P. Heggernes. Minimal triangulations of graphs: A survey. To appear Discrete Math.
9. P. Heggernes, K. Suchan, I. Todinca, and Y. Villanger. Minimal interval completions. Technical Report RR2005-04, LIFO - University of Orléans, 2005. http://www.univ-orleans.fr/SCIENCES/LIFO/prodsci/rapports/RR2005.htm.en.
10. T. Kloks, D. Kratsch, and J. Spinrad. On treewidth and minimum fill-in of asteroidal triple-free graphs. Theor. Comput. Sci., 175:309-335, 1997.
11. G.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.
12. A. Parra and P. Scheffler. Characterizations and algorithmic applications of chordal graph embeddings. Disc. Appl. Math., 79:171-188, 1997.
13. D. Rose, R.E. Tarjan, and G. Lueker. Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput., 5:146-160, 1976.
14. M. Yannakakis. Computing the minimum fill-in is NP-complete. SIAM J. Alg. Disc. Meth., 2:77-79, 1981.