The Branch-Width of Circular-Arc Graphs
From MaRDI portal
Publication:3525805
DOI10.1007/11682462_66zbMath1145.68474OpenAlexW1500561220MaRDI QIDQ3525805
Publication date: 18 September 2008
Published in: LATIN 2006: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11682462_66
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (4)
Constructing Brambles ⋮ Tangle bases: Revisited ⋮ Computing branchwidth via efficient triangulations and blocks ⋮ A constant factor approximation algorithm for boxicity of circular arc graphs
This page was built for publication: The Branch-Width of Circular-Arc Graphs
