Graph minors: X. obstructions to tree-decomposition
Journal of Combinatorial Theory Series B
Treewidth of Circular-Arc Graphs
SIAM Journal on Discrete Mathematics
Characterizations and algorithmic applications of chordal graph embeddings
Proceedings of the 4th Twente workshop on Graphs and combinatorial optimization
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Computing branchwidth via efficient triangulations and blocks
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Computing branchwidth via efficient triangulations and blocks
Discrete Applied Mathematics
A constant factor approximation algorithm for boxicity of circular arc graphs
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
| Hi-index | 0.00 |
We prove that the branch-width of circular-arc graphs can be computed in polynomial time.