Treewidth and pathwidth of cocomparability graphs of bounded dimension

In this paper we describe a polynomial time algorithm computing the treewidth of a cocomparability graph of bounded dimension. We do not assume that an intersection model of t.he graph is part of the input.

[1]  P. D. Moerland,et al.  Exercises in multiprogramming , 1993 .

[2]  J. Zwiers,et al.  Assertional Data Reification Proofs: Survey and Perspective , 1991 .

[3]  Dieter Kratsch,et al.  Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators , 1993, ESA.

[4]  C. Pandu Rangan,et al.  Treewidth of Circular-Arc Graphs , 1994, SIAM J. Discret. Math..

[5]  Hans L. Bodlaender.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC '93.

[6]  Fairouz Kamareddine,et al.  Non well-foundedness and type freeness can unify the interpretation of functional application , 1992 .

[7]  Erik Poll,et al.  Some categorical properties for a model for second order lambda calculus with subtyping , 1991 .

[8]  M. Yannakakis.  The Complexity of the Partial Order Dimension Problem , 1982 .

[9]  David S. Johnson,et al.  The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.

[10]  Gerard Zwaan,et al.  A taxonomy of keyword pattern matching algorithms , 1992 .

[11]  Jan A. Bergstra,et al.  Axiomatizing Probabilistic Processes: ACP with Generative Probabilities , 1995, Inf. Comput..

[12]  Dieter Kratsch,et al.  Finding All Minimal Separators of a Graph , 1994, STACS.

[13]  van Km Kees Hee,et al.  Systems engineering : a formal approach. Part I. System concepts , 1993 .

[14]  Ton Kloks,et al.  Treewidth of Circle Graphs , 1993, ISAAC.

[15]  G. Dirac.  On rigid circuit graphs , 1961 .

[16]  Dick Alstein,et al.  Dynamic reconfiguration in distributed hard real-time systems , 1991 .

[17]  Jos C. M. Baeten,et al.  A Congruence Theorem for Structured Operational Semantics with Predicates , 1993, CONCUR.

[18]  P. Gilmore,et al.  A Characterization of Comparability Graphs and of Interval Graphs , 1964, Canadian Journal of Mathematics.

[19]  Jorge Urrutia,et al.  Comparability graphs and intersection graphs , 1983, Discret. Math..

[20]  Rolf H. Möhring,et al.  The Pathwidth and Treewidth of Cographs , 1993, SIAM J. Discret. Math..

[21]  Dieter Kratsch,et al.  Treewidth and Pathwidth of Permutation Graphs , 1993, ICALP.

[22]  Jens Gustedt,et al.  On the Pathwidth of Chordal Graphs , 1993, Discret. Appl. Math..