The Pathwidth and Treewidth of Cographs

Abstract

Next article The Pathwidth and Treewidth of CographsHans L. Bodlaender and Rolf H. MöhringHans L. Bodlaender and Rolf H. Möhringhttps://doi.org/10.1137/0406014PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAboutAbstractIt is shown that the pathwidth of a cograph equals its treewidth, and a linear time algorithm to determine the pathwidth of a cograph and build a corresponding path-decomposition is given.[1] Stefan Arnborg, Efficient algorithms for combinatorial problems on graphs with bounded decomposability—a survey, BIT, 25 (1985), 2–23 86k:68038 0573.68018 CrossrefGoogle Scholar[2] Stefan Arnborg, , Derek G. Corneil and , Andrzej Proskurowski, Complexity of finding embeddings in a k-tree, SIAM J. Algebraic Discrete Methods, 8 (1987), 277–284 88f:05035 0611.05022 LinkISIGoogle Scholar[3] Stefan Arnborg and , Andrzej Proskurowski, Linear time algorithms for NP-hard problems restricted to partial k-trees, Discrete Appl. Math., 23 (1989), 11–24 10.1016/0166-218X(89)90031-0 90a:05156 0666.68067 CrossrefISIGoogle Scholar[4] H. L. Bodlaender, Classes of graphs with bounded treewidth, Tech. Report, RUU-CS-86-22, Dept. of Computer Science, Univ. of Utrecht, Utrecht, the Netherlands, 1986 Google Scholar[5] Hans L. Bodlaender, Dynamic programming on graphs with bounded treewidthAutomata, languages and programming (Tampere, 1988), Lecture Notes in Comput. Sci., Vol. 317, Springer, Berlin, 1988, 105–118, Proc. 15th Internat. Colloquim, New York 90k:68064 0649.68039 CrossrefGoogle Scholar[6] Hans L. Bodlaender and , Ton Kloks, Better algorithms for the pathwidth and treewidth of graphsAutomata, languages and programming (Madrid, 1991), Lecture Notes in Comput. Sci., Vol. 510, Springer, Berlin, 1991, 544–555, Proc. 18th Internat. Colloquim, New York 1 129 934 0764.68108 CrossrefGoogle Scholar[7] D. G. Corneil, , H. Lerchs and , L. Stewart Burlingham, Complement reducible graphs, Discrete Appl. Math., 3 (1981), 163–174 10.1016/0166-218X(81)90013-5 84d:05137 0463.05057 CrossrefISIGoogle Scholar[8] D. G. Corneil, , Y. Perl and , L. Stewart, A linear recognition algorithm for cographs, SIAM J. Comput., 14 (1985), 926–934 10.1137/0214065 86m:68117 0575.68065 LinkISIGoogle Scholar[9] Michael R. Fellows and , Michael A. Langston, J. Allen and , F. T. Leighton, Layout permutation problems and well-partially-ordered setsAdvanced research in VLSI (Cambridge, MA, 1988), MIT Press, Cambridge, MA, 1988, 315–327, Proc. Fifth M.I.T. Conference, published as Advanced Research in VLSI 942 956 Google Scholar[10] Michael R. Fellows and , Michael A. Langston, Nonconstructive tools for proving polynomial-time decidability, J. Assoc. Comput. Mach., 35 (1988), 727–739 10.1145/44483.44491 90i:68046 0652.68049 CrossrefISIGoogle Scholar[11] Martin Charles Golumbic, Algorithmic graph theory and perfect graphs, Academic Press [Harcourt Brace Jovanovich Publishers], New York, 1980xx+284 81e:68081 0541.05054 Google Scholar[12] J. Gustedt, Path width for chordal graphs is NP-complete, Tech. Report 221/1989, Technical Univ. Berlin, Berlin, Germany, 1989; Discrete Appl. Math., to appear Google Scholar[13] Lefteris M. Kirousis and , Christos H. Papadimitriou, Interval graphs and searching, Discrete Math., 55 (1985), 181–184 10.1016/0012-365X(85)90046-9 87a:05088 0566.05056 CrossrefISIGoogle Scholar[14] Lefteris M. Kirousis and , Christos H. Papadimitriou, Searching and pebbling, Theoret. Comput. Sci., 47 (1986), 205–218 10.1016/0304-3975(86)90146-5 89a:68073 0616.68064 CrossrefISIGoogle Scholar[15] Rolf H. Möhring, G. Tinhofer, Graph problems related to gate matrix layout and PLA foldingComputational graph theory, Comput. Suppl., Vol. 7, Springer, Vienna, 1990, 17–51 1 059 923 0699.68072 CrossrefGoogle Scholar[16] John H. Muller and , Jeremy Spinrad, Incremental modular decomposition, J. Assoc. Comput. Mach., 36 (1989), 1–19 10.1145/58562.59300 91i:68119 0671.68030 CrossrefISIGoogle Scholar[17] B. Reed, Finding approximate separators and computing treewidth quickly, Proc. 24th Annual Sympos. on Theory of Computing (STOC'92), 1992, 221–228 Google Scholar[18] Neil Robertson and , P. D. Seymour, Graph minors. I. Excluding a forest, J. Combin. Theory Ser. B, 35 (1983), 39–61 85d:05148 0521.05062 CrossrefISIGoogle Scholar[19] Neil Robertson and , P. D. Seymour, Graph minors. II. Algorithmic aspects of tree-width, J. Algorithms, 7 (1986), 309–322 88c:05053 0611.05017 CrossrefISIGoogle Scholar[20] Neil Robertson and , P. D. Seymour, I. Anderson, Graph minors—a surveySurveys in combinatorics 1985 (Glasgow, 1985), London Math. Soc. Lecture Note Ser., Vol. 103, Cambridge Univ. Press, Cambridge, UK, 1985, 153–171 87e:05130 0568.05025 CrossrefGoogle Scholar[21] P. Scheffler, Ph.D. Thesis, Die Baumweite von Graphen als ein Maßfür die Kompliziertheit algorithmischer Probleme, Akademie der Wissenschaften der DDR, Berlin, 1989 0684.68061 Google Scholar[22] R. Sundaram, , K. S. Singh and , C. P. Ranganc, Treewidth of circular-arc graphs, 1991, manuscript Google ScholarKeywordsgraph algorithmscographstreewidthpathwidth Next article FiguresRelatedReferencesCited byDetails From modular decomposition trees to level-1 networks: Pseudo-cographs, polar-cats and prime polar-catsDiscrete Applied Mathematics, Vol. 321 Cross Ref Remarks on Parameterized Complexity of Variations of the Maximum-Clique Transversal Problem on Graphs24 March 2022 | Symmetry, Vol. 14, No. 4 Cross Ref Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space Cross Ref Computing subset transversals in H-free graphsTheoretical Computer Science, Vol. 902 Cross Ref Finding a maximum minimal separator: Graph classes and fixed-parameter tractabilityTheoretical Computer Science, Vol. 865 Cross Ref How to compute digraph width measures on directed co-graphsTheoretical Computer Science, Vol. 855 Cross Ref On characterizations for subclasses of directed co-graphs27 November 2020 | Journal of Combinatorial Optimization, Vol. 41, No. 1 Cross Ref As Time Goes By: Reflections on Treewidth for Temporal Graphs20 April 2020 Cross Ref A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection GraphsMark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, and Tom C. van der Zanden15 December 2020 | SIAM Journal on Computing, Vol. 49, No. 6AbstractPDF (1264 KB)Breaking Symmetries with RootClique and LexTopSort2 September 2020 Cross Ref Network Decontamination13 January 2019 Cross Ref Characterizations for Special Directed Co-graphs23 November 2019 Cross Ref Computing Digraph Width Measures on Directed Co-graphs10 July 2019 Cross Ref Contraction and deletion blockers for perfect graphs and H-free graphsTheoretical Computer Science, Vol. 746 Cross Ref Directed Path-Width and Directed Tree-Width of Directed Co-graphs29 June 2018 Cross Ref An SMT Approach to Fractional Hypertree Width23 August 2018 Cross Ref Comparing the metric and strong dimensions of graphsDiscrete Applied Mathematics, Vol. 220 Cross Ref Exclusive graph searching vs. pathwidthInformation and Computation, Vol. 252 Cross Ref Integer Linear Programming Formulation and Exact Algorithm for Computing Pathwidth10 December 2016 Cross Ref A quality and distance guided metaheuristic algorithm for vertex separation problemIEEE Access Cross Ref Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed PathwidthACM Journal of Experimental Algorithmics, Vol. 21 Cross Ref Tree decompositions and social graphs16 May 2016 | Internet Mathematics, Vol. 12, No. 5 Cross Ref Parameterized complexity dichotomy for Steiner MulticutJournal of Computer and System Sciences, Vol. 82, No. 6 Cross Ref Computing Directed Pathwidth in $$O(1.89^{n})$$ O ( 1 . 89 n ) Time10 June 2015 | Algorithmica, Vol. 75, No. 1 Cross Ref The Treewidth of Induced Graphs of Conditional Preference Networks Is Small14 February 2016 | Information, Vol. 7, No. 1 Cross Ref Kernelization, Preprocessing for Treewidth22 April 2016 Cross Ref Neighbourhood-width of treesDiscrete Mathematics, Vol. 339, No. 1 Cross Ref The complexity of minimum-length path decompositionsJournal of Computer and System Sciences, Vol. 81, No. 8 Cross Ref k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth23 January 2014 | Algorithmica, Vol. 72, No. 3 Cross Ref On the spectrum and number of convex sets in graphsDiscrete Mathematics, Vol. 338, No. 7 Cross Ref Contraction Blockers for Graphs with Forbidden Induced Paths16 May 2015 Cross Ref FPT is characterized by useful obstruction setsACM Transactions on Computation Theory, Vol. 6, No. 4 Cross Ref A revisit of the scheme for computing treewidth and minimum fill-inTheoretical Computer Science, Vol. 531 Cross Ref Kernelization, Preprocessing for Treewidth13 October 2014 Cross Ref Recursively Constructed Graphs26 November 2013 Cross Ref Pursuit-Evasion Problems26 November 2013 Cross Ref Two characterisations of the minimal triangulations of permutation graphsDiscrete Mathematics, Vol. 313, No. 20 Cross Ref Preprocessing for Treewidth: A Combinatorial Analysis through KernelizationHans L. Bodlaender, Bart M. P. Jansen, and Stefan Kratsch17 December 2013 | SIAM Journal on Discrete Mathematics, Vol. 27, No. 4AbstractPDF (445 KB)Fixed-Parameter Tractability of Treewidth and Pathwidth Cross Ref Kernel Bounds for Structural Parameterizations of Pathwidth Cross Ref Computing Directed Pathwidth in O(1.89 n ) Time Cross Ref Probabilistic Inference and Monadic Second Order Logic Cross Ref Algorithms and complexity results for graph-based pursuit evasion17 September 2011 | Autonomous Robots, Vol. 31, No. 4 Cross Ref Acyclic and star colorings of cographsDiscrete Applied Mathematics, Vol. 159, No. 16 Cross Ref Linear-time algorithm for the matched-domination problem in cographsInternational Journal of Computer Mathematics, Vol. 88, No. 10 Cross Ref Weighted Maximum-Clique Transversal Sets of GraphsISRN Discrete Mathematics, Vol. 2011 Cross Ref Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization Cross Ref Treewidth and minimum fill-in on permutation graphs in linear timeTheoretical Computer Science, Vol. 411, No. 40-42 Cross Ref Dynamic programming and planarity: Improved tree-decomposition based algorithmsDiscrete Applied Mathematics, Vol. 158, No. 7 Cross Ref Treewidth computations I. Upper boundsInformation and Computation, Vol. 208, No. 3 Cross Ref Baumweitebeschränkte Graphen31 August 2010 Cross Ref Solving problems on recursively constructed graphsACM Computing Surveys, Vol. 41, No. 1 Cross Ref Node-searching problem on block graphsDiscrete Applied Mathematics, Vol. 156, No. 1 Cross Ref Approximating the maximum clique minor and some subgraph homeomorphism problemsTheoretical Computer Science, Vol. 374, No. 1-3 Cross Ref Inference and Learning in Multi-dimensional Bayesian Network Classifiers Cross Ref Two characterisations of minimal triangulations of 2K2 -free graphsDiscrete Mathematics, Vol. 306, No. 24 Cross Ref Linear layouts measuring neighbourhoods in graphsDiscrete Mathematics, Vol. 306, No. 15 Cross Ref A vertex incremental approach for maintaining chordalityDiscrete Mathematics, Vol. 306, No. 3 Cross Ref Graph Searching and Search Time Cross Ref Treewidth: Characterizations, Applications, and Computations Cross Ref Efficient parallel recognition of cographsDiscrete Applied Mathematics, Vol. 150, No. 1-3 Cross Ref Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time Cross Ref Discovering Treewidth Cross Ref Tree decompositions with small costDiscrete Applied Mathematics, Vol. 145, No. 2 Cross Ref Tree-decompositions of small pathwidthDiscrete Applied Mathematics, Vol. 145, No. 2 Cross Ref Chordal co-gem-free and ( P5 ,gem)-free graphs have bounded clique-widthDiscrete Applied Mathematics, Vol. 145, No. 2 Cross Ref Approximation algorithms for classes of graphs excluding single-crossing graphs as minorsJournal of Computer and System Sciences, Vol. 69, No. 2 Cross Ref Parallel algorithms for Hamiltonian problems on quasi-threshold graphsJournal of Parallel and Distributed Computing, Vol. 64, No. 1 Cross Ref Construction of linear tree-layouts which are optimal with respect to vertex separation in linear timeJournal of Algorithms, Vol. 47, No. 1 Cross Ref New Lower and Upper Bounds for Graph Treewidth13 May 2003 Cross Ref A survey of graph layout problemsACM Computing Surveys, Vol. 34, No. 3 Cross Ref Safe Reduction Rules for Weighted Treewidth28 February 2003 Cross Ref Tree Decompositions with Small Cost21 June 2002 Cross Ref Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition21 June 2002 Cross Ref 1.5-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor4 October 2002 Cross Ref Automata-based Representations for Infinite Graphs15 April 2002 | RAIRO - Theoretical Informatics and Applications, Vol. 35, No. 4 Cross Ref The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphsTheoretical Computer Science, Vol. 244, No. 1-2 Cross Ref Edge and node searching problems on treesTheoretical Computer Science, Vol. 240, No. 2 Cross Ref Graph Searching and Interval CompletionFedor V. Fomin and Petr A. Golovach1 August 2006 | SIAM Journal on Discrete Mathematics, Vol. 13, No. 4AbstractPDF (145 KB)Computing Optimal Linear Layouts of Trees in Linear Time11 February 2003 Cross Ref Efficient Analy sis of Graphs with Small Minimal Separators Cross Ref Partial and perfect path covers of cographsDiscrete Applied Mathematics, Vol. 89, No. 1-3 Cross Ref Triangulating graphs with few P4'sDiscrete Applied Mathematics, Vol. 89, No. 1-3 Cross Ref A partial k-arboretum of graphs with bounded treewidthTheoretical Computer Science, Vol. 209, No. 1-2 Cross Ref An optimal parallel algorithm for node ranking of cographsDiscrete Applied Mathematics, Vol. 87, No. 1-3 Cross Ref Triangulating multitolerance graphsDiscrete Applied Mathematics, Vol. 84, No. 1-3 Cross Ref Representing hyper-graphs by regular languages28 May 2006 Cross Ref A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree4 June 2002 Cross Ref On Interval Routing Schemes and TreewidthInformation and Computation, Vol. 139, No. 1 Cross Ref Treewidth for graphs with small chordalityDiscrete Applied Mathematics, Vol. 79, No. 1-3 Cross Ref Characterizations and algorithmic applications of chordal graph embeddingsDiscrete Applied Mathematics, Vol. 79, No. 1-3 Cross Ref Algorithms for the treewidth and minimum fill-in of HHD-free graphs17 June 2005 Cross Ref Treewidth: Algorithmic techniques and results17 June 2005 Cross Ref Edge and node searching problems on trees24 January 2006 Cross Ref A Linear-Time Algorithm for Finding Tree-Decompositions of Small TreewidthHans L. Bodlaender31 July 2006 | SIAM Journal on Computing, Vol. 25, No. 6AbstractPDF (1912 KB)On intervalizing k-colored graphs for DNA physical mappingDiscrete Applied Mathematics, Vol. 71, No. 1-3 Cross Ref Triangulating graphs without asteroidal triplesDiscrete Applied Mathematics, Vol. 64, No. 3 Cross Ref Graph searching on chordal graphs11 October 2005 Cross Ref Treewidth and Pathwidth of Permutation GraphsHans L. Bodlaender, Ton Kloks, and Dieter Kratsch1 August 2006 | SIAM Journal on Discrete Mathematics, Vol. 8, No. 4AbstractPDF (1542 KB)Tree-width and path-width of comparability graphs of interval orders1 June 2005 Cross Ref Fugitive-search games on graphs and related parameters1 June 2005 Cross Ref How to use the minimal separators of a graph for its chordal triangulation7 June 2005 Cross Ref On Interval Routing Schemes and treewidth2 June 2005 Cross Ref Treewidth of cocomparability graphs and a new order-theoretic parameterOrder, Vol. 11, No. 1 Cross Ref On the Treewidth and Pathwidth of Biconvex Bipartite Graphs Cross Ref A Characterisation of the Minimal Triangulations of Permutation Graphs Cross Ref How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms Cross Ref Volume 6, Issue 2| 1993SIAM Journal on Discrete Mathematics History Submitted:20 August 1990Accepted:01 April 1992Published online:17 February 2012 InformationCopyright © 1993 Society for Industrial and Applied MathematicsKeywordsgraph algorithmscographstreewidthpathwidthMSC codes05C0505C8568R10PDF Download Article & Publication DataArticle DOI:10.1137/0406014Article page range:pp. 181-188ISSN (print):0895-4801ISSN (online):1095-7146Publisher:Society for Industrial and Applied Mathematics