Abstract
We give an O(mnlog log n+m 2)-time algorithm to recognize perfect circular-arc graphs.
This work was supported by the Natural Sciences and Engineering Research Council of Canada (NSERC), the Research Council of The University of Dayton, and Wilfrid Laurier University.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
S.R. Arikati, C. Pandu Rangan, and G.K. Manacher, Efficient reduction for path problems on circular-arc graphs, BIT 31 (1991), 182–193.
S.R. Arikati and U.N. Peled, A linear algorithm for group path problem on chordal graphs, Discrete Appl. Math. 44 (1993), 185–190.
D. Bienstock, On the complexity of testing for odd holes and induced odd paths, Discrete Math. 90 (1991), 85–92. See also corrigendum by B. Reed, Discrete Math. 102 (1992), p. 109.
C. Berge, Perfect graphs, 1–21, Six Papers on Graph Theory, Indian Statistical Institute, 1963.
K. Cameron and J. Edmonds, Existentially polytime theorems, Polyhedral Combinatorics, 83–100, DIMACS Ser. Discrete Math. Theoret. Comput. Sci., 1, Amer. Math. Soc., Providence, RI, 1990.
M. Chudnovsky, G. Cornuéjols, X. Liu, P. Seymour, and K. Vušković, Recognizing Berge graphs, Combinatorica 25 (2005), 143–187.
M. Chudnovsky, N. Robertson, P. Seymour, and R. Thomas, The strong perfect graph theorem, Annals of Math., to appear.
E.M. Eschen and J.P. Spinrad, An O(n 2) algorithm for circular-arc graph recognition, Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Austin, TX, 1993), 128–137, ACM, New York, 1993.
H. Everett, C. de Figueiredo, C.L. Sales, F. Maffray, O. Porto, and B. Reed, Even pairs, in Perfect graphs, edited by J.L. R. Alfonsín and B. A. Reed, John Wiley & Sons, Ltd, 2001.
J. Fonlupt and J.P. Uhry, Transformations which preserve perfectness and h-perfectness of graphs, Ann. Discrete Math. 16 (1982), 83–85.
W.L. Hsu, O(M N) algorithms for the recognition and isomorphism problems on circular-arc graphs, SIAM J. Comput. 24 (1995), 411–439.
B. Lévêque, F. Maffray, B. Reed and N. Trotignon, Coloring Artemis graphs, Manuscript.
L. Lovász, A characterization of perfect graphs, J. Combinatorial Theory (Ser. B) 13 (1972), 95–98.
F. Maffray and N. Trotignon, A class of perfectly contractile graphs, Manuscript, 2002.
R. McConnell, Linear-time recognition of circular-arc graphs, Algorithmica 37 (2003),93–147.
S.D. Nikolopoulos and L. Palios, Hole and antihole detection in graphs, Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2004, 843–852.
C.R. Satyan and C. Pandu Rangan, The parity path problem on some subclasses of perfect graphs, Discrete Appl. Math. 68 (1996), 293–302.
J.P. Spinrad, Efficient Graph Representations, American Mathematical Society, Providence, Rhode Island, 2003.
A. Tucker, Coloring a family of circular arcs, SIAM J. Appl. Math. 29 (1975), 493–502.
P. Van Emde Boas, Preserving order in a forest in less than logarithmic time and linear space, Information Processing Letters 6 (1977), 80–82.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Birkhäuser Verlag Basel/Switzerland
About this chapter
Cite this chapter
Cameron, K., Eschen, E.M., Hoàng, C.T., Sritharan, R. (2006). Recognition of Perfect Circular-arc Graphs. In: Bondy, A., Fonlupt, J., Fouquet, JL., Fournier, JC., Ramírez Alfonsín, J.L. (eds) Graph Theory in Paris. Trends in Mathematics. Birkhäuser Basel. https://doi.org/10.1007/978-3-7643-7400-6_9
Download citation
DOI: https://doi.org/10.1007/978-3-7643-7400-6_9
Publisher Name: Birkhäuser Basel
Print ISBN: 978-3-7643-7228-6
Online ISBN: 978-3-7643-7400-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)