Efficient construction of unit circular-arc models

DOI10.1145/1109557.1109592MaRDI QIDQ3581535zbMATH OpenOpenAlexFDO

Authors Min Chih Lin, Jayme L. Szwarcfiter

Publication date 16 August 2010

Published in Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1109557.1109592

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(8)

• Characterizations and recognition of circular-arc graphs and subclasses: a survey
• Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
• Partial Characterizations of Circular-Arc Graphs
• Proper Helly Circular-Arc Graphs
• Partial characterizations of circular-arc graphs
• From a Circular-Arc Model to a Proper Circular-Arc Model
• Linear-time recognition of Helly circular-arc models and graphs
• Partial characterizations of circle graphs

This page was built for publication: Efficient construction of unit circular-arc models

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