On the Treewidth and Pathwidth of Biconvex Bipartite Graphs

DOI10.1007/978-3-540-72504-6_22zbMath1198.05144OpenAlexW1489916852MaRDI QIDQ5425437

No author found.

Publication date: 13 November 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72504-6_22

zbMATH Keywords

treewidthpathwidthbipartite permutation graphbiconvex bipartite graphbiclique structureconcatenation operators

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

Edge Search Number of Cographs in Linear Time ⋮ Pathwidth is NP-Hard for Weighted Trees ⋮ Edge search number of cographs ⋮ Simultaneous consecutive ones submatrix and editing problems: classical complexity and fixed-parameter tractable results

This page was built for publication: On the Treewidth and Pathwidth of Biconvex Bipartite Graphs