Recognition of perfect circular-arc graphs. (English) Zbl 1114.05043
Bondy, Adrian (ed.) et al., Graph theory in Paris. Proceedings of a conference, GT04, in memory of Claude Berge, Paris, France, July 2004. Basel: Birkhäuser (ISBN 3-7643-7228-1/hbk). Trends in Mathematics, 97-108 (2007).
In the paper, there is an \(O(mn\log\log n+m^2)\)-time algorithm to recognize perfect arc-circular graphs.
For the entire collection see [Zbl 1098.05001].
For the entire collection see [Zbl 1098.05001].
Reviewer: Martin Knor (Bratislava)
MSC:
| 05C17 | Perfect graphs |
| 05C85 | Graph algorithms (graph-theoretic aspects) |
| 68Q25 | Analysis of algorithms and problem complexity |
