Abstract
We present two algorithms solving the minimum fill-in problem on circle graphs and on circular-arc graphs in time O(n 3).
This research was done while this author was with the department of computer science and engineering of the Chinese university of Hong Kong, Shatin, Hong Kong, as a research fellow.
On leave from IBM T.J. Watson Research Center, P.O.Box 218, Yorktown Heights, NY 10598, U.S.A.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
H. Bodlaender, L. van der Gaag and T. Kloks. Some remarks on minimum edge and minimum clique triangulations, manuscript.
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.
D. G. Corneil, Y. Perl and L. K. Stewart, Cographs: recognition, applications and algorithms, Congressus Numerantium 43 (1984), pp. 249–258.
E.M. Eschen and J.P. Spinrad, An O(n 2) algorithm for circular-arc graph recognition. Proceedings of SODA '93, pp. 128–137.
M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
T. Kloks, Treewidth of circle graphs, Proceedings of ISAAC'93, Springer-Verlag, LNCS 762, 1993, pp. 108–117.
T. Kloks, Minimum fill-in for chordal bipartite graphs, Technical report RUU-CS-93-11, Utrecht University, 1993.
T. Kloks, Treewidth-Computations and Approximations, Springer-Verlag, Lecture Notes in Computer Science 842, 1994.
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.
D. Kratsch, The structure of graphs and the design of efficient algorithms, Habilitation (thesis), F.-Schiller-Universität Jena, 1995.
A. Parra, Triangulating multitolerance graphs, Technical Report 392/1994, Technische Universität Berlin.
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.
J. Spinrad, Recognition of circle graphs, J. Algorithms 16 (1994), pp. 264–282.
J. Spinrad, A. Brandstädt and L. K. Stewart, Bipartite permutation graphs, Discrete Applied Mathematics 18 (1987), pp. 279–292.
R. Sundaram, K. Sher Singh and C. Pandu Rangan, Treewidth of circular arc graphs, SIAM Journal on Discrete Mathematics 7 (1994), pp. 647–655.
R. E. Tarjan, Decomposition by clique separators, Discrete Mathematics 55 (1985), pp. 221–232.
M. Yannakakis, Computing the minimum fill-in is NP-complete, SIAM Journal on Algebraic and Discrete Methods 2 (1981), pp. 77–79.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kloks, T., Kratsch, D., Wong, C.K. (1996). Minimum fill-in on circle and circular-arc graphs. In: Meyer, F., Monien, B. (eds) Automata, Languages and Programming. ICALP 1996. Lecture Notes in Computer Science, vol 1099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61440-0_133
Download citation
DOI: https://doi.org/10.1007/3-540-61440-0_133
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61440-1
Online ISBN: 978-3-540-68580-7
eBook Packages: Springer Book Archive