Efficient construction of unit circular-arc models

DOI10.1145/1109557.1109592zbMath1192.68487OpenAlexW4252142501MaRDI QIDQ3581535

Min Chih Lin, Jayme Luiz 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

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

Related Items (8)

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

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