Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs
From MaRDI portal
Publication:3522966
DOI10.1007/11917496_26zbMath1167.05333OpenAlexW2171208856MaRDI QIDQ3522966
Publication date: 4 September 2008
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11917496_26
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 (10)
From a Circular-Arc Model to a Proper Circular-Arc Model ⋮ Proper Helly Circular-Arc Graphs ⋮ Linear-time recognition of Helly circular-arc models and graphs ⋮ A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs ⋮ A simple certifying algorithm for 3-edge-connectivity ⋮ Certifying algorithms ⋮ Powers of cycles, powers of paths, and distance graphs ⋮ Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs ⋮ The clique operator on circular-arc graphs ⋮ Characterizations and recognition of circular-arc graphs and subclasses: a survey
This page was built for publication: Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs
