Direct and Certifying Recognition of Normal Helly Circular-Arc Graphs in Linear Time

DOI10.1007/978-3-319-08016-1_2MaRDI QIDQ3188829zbMATH OpenOpenAlexFDO

Authors Yixin Cao

Publication date 2 September 2014

Published in Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-08016-1_2

zbMATH Keywords

direct recognition algorithm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs
• Linear-time recognition of Helly circular-arc models and graphs
• Linear-time recognition of circular-arc graphs
• A simpler linear-time recognition of circular-arc graphs
• A Simpler Linear-Time Recognition of Circular-Arc Graphs
• A certifying and dynamic algorithm for the recognition of proper circular-arc graphs
• Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs
• Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
• Polynomial time recognition of unit circular-arc graphs
• scientific article; zbMATH DE number 437537

Cited in

(9)

• Linear-time recognition of circular-arc graphs
• Normal Helly circular-arc graphs and its subclasses
• Essential obstacles to Helly circular-arc graphs
• Forbidden induced subgraphs of normal Helly circular-arc graphs: characterization and detection
• Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs
• A Simpler Linear-Time Recognition of Circular-Arc Graphs
• Linear-time recognition of Helly circular-arc models and graphs
• Certifying induced subgraphs in large graphs
• Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs

This page was built for publication: Direct and Certifying Recognition of Normal Helly Circular-Arc Graphs in Linear Time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3188829)