Linear-time representation algorithms for proper circular-arc graphs and proper interval graphs

SIAM Journal on Computing

Volumn 25, Issue 2, 1996, Pages 390-403

  Deng, Xiaotie ^a   Hell, Pavol ^b   Huang, Jing ^b  

^a YORK UNIVERSITY   (Canada)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Local tournaments; Proper circular arc graphs; Proper interval graphs; Representation algorithms

Indexed keywords

COMPUTATIONAL METHODS; DATA STRUCTURES; GRAPH THEORY; TREES (MATHEMATICS);

LINEAR TIME ALGORITHMS; LOCAL TOURNAMENTS; PROPER CIRCULAR ARC GRAPHS; PROPER INTERVAL GRAPHS; REPRESENTATION ALGORITHMS; TIME COMPLEXITY;

ALGORITHMS;

EID: 0030128324     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539792269095     Document Type: Article

References (19)

1. J. BANG-JENSEN, Locally semicomplete digraphs: A generalization of tournaments, J. Graph Theory, 14 (1990), pp. 371-390.
2. J. BANG-JENSEN, P. HELL, AND J. HUANG, Local tournaments and proper circular arc graphs, Technical report CSS/LCCR TR90-11, Simon Fraser University, Burnaby, BC, Canada, 1990.
3. J. BANG-JENSEN AND P. HELL, A note on chordal proper circular arc graphs, Discrete Math., 128 (1994), pp. 395-398.
4. B. BHATTACHARYA, P. HELL, AND J. HUANG, A linear algorithm for maximum cliques in proper circular arc graphs, SIAM J. Discrete Math., 9 (1996), to appear.
5. K. S. BOOTH AND G. S. LUEKER, Testing for the consecutive ones property using PQ-tree algorithms, J. Comput. System Sci. 13 (1976), pp. 335-379.
6. X. DENG, P. HELL, AND J. HUANG, Recognition and representation of proper circular arc graphs, in Integer Programming and Combinatorial Optimization, Proc. 2nd Integer Programming and Combinatorial Optimization Conference, E. Balas, G. Cornuejols, and R. Kannan, eds., Carnegie-Mellon University, Pittsburgh, PA, 1992, pp. 114-121.
7. M. C. GOLUMBIC, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
8. P. HELL, J. BANG-JENSEN, AND J. HUANG, Local tournaments and proper circular arc graphs, in Algorithms, Springer-Verlag Lecture Notes in Computer Science, T. Asano, T. Ibaraki, H. Imai, and T. Nishizeki, eds., Springer-Verlag, Berlin, New York, 1990, pp. 101-109.
9. P. HELL AND J. HUANG, Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs, J. Graph Theory, 20 (1995), pp. 361-374.
10. W. L. HSU, A simple test of interval graphs, in Proc. SIAM Conference on Discrete Mathematics, Vancouver, 1992.
11. W. L. HSU AND K. H. TSAI, Linear time algorithms on circular arc graphs, Inform. Proc. Lett., 40 (1991), pp. 123-129.
12. J. HUANG, On the structure of local tournaments, J. Combin. Theory Ser. B, 63 (1995), pp. 200-221.
13. _, Tournament-like oriented graphs, Ph.D. thesis, Simon Fraser University, Burnaby, BC, Canada, 1992.
14. N. KORTE AND R. H. MÖHRING, An incremental linear-time algorithm for recognizing interval graphs, SIAM J. Comput., 18 (1989), pp. 68-81.
15. 2) algorithm for coloring proper circular arc graphs, SIAM J. Algebraic Discrete Meth., 2 (1981), pp. 88-93.
16. D. J. SKRIEN, A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular arc graphs and nested interval graphs, J. Graph Theory, 6 (1982), pp. 309-316.
17. A. TENG AND A. TUCKER, An O(qn) algorithm to q-color a proper family of circular arcs, Discrete Math., 55 (1985), pp. 233-243.
18. A. TUCKER, Matrix characterization of circular arc graphs, Pacific J. Math, 39 (1971), pp. 535-545.
19. n, Ph.D. thesis, Universität Gottingen, Gottingen, Germany, 1967.