Minimum fill-in on circle and circular-arc graphs

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

Volumn 1099, Issue , 1996, Pages 256-267

  Kloks, T ^a   Kratsch, D ^b   Wong, C K ^c  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

^c CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CIRCLE GRAPHS; CIRCULAR-ARC GRAPH;

AUTOMATA THEORY;

EID: 0347886370     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61440-0_133     Document Type: Conference Paper

References (17)

1. H. Bodlaender, L. van der Gaag and T. Kloks, Some remarks on minimum edge and minimum clique triangulations, manuscript.
2. H. Bodlaender, T. Kloks, D. Kratsch and H. Müller, Treewidth and minimum fill-in on d-trapezoid graphs. Technical Report. UU-CS-1995-34, Utrecht University.
3. D.G. Cornell, Y. Perl and L.K. Stewart, Cographs: recognition, applications and algorithms, Congressus Numerantium 43 (1984), pp. 249-258.
4. 2) algorithm for circular-arc graph recognition, Proceedings of SODA '93, pp. 128-137.
5. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New-York, 1980.
6. T. Kloks, Treewidth of circle graphs, Proceedings ofISAAC'93, Springer-Verlag, LNCS 762, 1993, pp. 108-117.
7. T. Kloks, Minimum fill-in for chordal bipartite graphs, Technical report RUU-CS-93-11, Utrecht University, 1993.
8. T. Kloks, Treewidth-Computotions and Approximations, Springer-Verlag, Lecture Notes in Computer Science 842, 1994.
9. T. Kloks, D. Kratsch and H. Müller, Approximating the bandwidth of AT-free graphs, Proceedings of ESA'95, Springer-Verlag, LNCS 979, 1995, pp. 434-447.
10. D. Kratsch, The structure of graphs and the design of efficient algorithms, Habilitation (thesis), F.-Schiller-Universität Jena, 1995.
11. A. Parra, Triangulating multitolerance graphs, Technical Report 392/1994, Technische Universität Berlin.
12. D.J. Rose, R.E. Tarjan and G.S. Lueker, Algorithmic aspects of vertex elimination on graphs. SIAM Journal on Computing 5 (1976), pp. 266-283.
13. J. Spinrad, Recognition of circle graphs, J. Algorithms 16 (1994), pp. 264-282.
14. J. Spinrad, A. Brandstädt and L.K. Stewart, Bipartite permutation graphs, Discrete Applied Mathematics 18 (1987), pp. 279-292.
15. R. Sundaram, K. Sher Singh and C. Pandu Rangan, Treewidth of circular arc graphs, SIAM Journal on Discrete Mathematics 7 (1994), pp. 647-655.
16. R.E. Tarjan, Decomposition by clique separators, Discrete Mathematics 55 (1985), pp. 221-232.
17. M. Yannakakis, Computing the minimum fill-in is NP-complete, SIAM Journal on Algebraic and Discrete Methods 2 (1981), pp. 77-79.