Algorithms pp 101-108 | Cite as

Local tournaments and proper circular arc graphs

  • Pavol Hell
  • Jørgen Bang-Jensen
  • Jing Huang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 450)

Abstract

A local tournament is a digraph in which the out-set as well as the in-set of every vertex is a tournament. These digraphs have recently been found to share many desirable properties of tournaments. We illustrate this by giving O(m+n logn) algorithms to find a hamiltonian path and cycle in a local tournament. We mention several characterizations and recognition algorithms of graphs orientable as local tournaments. It turns out that they are precisely the graphs previously studied as proper circular arc graphs. Thus we obtain new recognition algorithms for proper circular arc graphs. We also give a more detailed structural characterization of chordal graphs that are orientable as local tournaments, i.e., that are proper circular arc graphs.

Keywords

Assure Sorting 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    A. Apostolico and S. E. Hambrusch, Finding maximum cliques on circular arc graphs, Information Processing Letters 26 (1987) 209–215.CrossRefGoogle Scholar
  2. [2]
    J. Bang-Jensen, Locally semicomplete digraphs, J. Graph Theory, to appear.Google Scholar
  3. [3]
    M. A. Bonuccelli, Dominating sets and domatic number of circular arc graphs, Discrete Applied Math. 12 (1985) 203–213.CrossRefGoogle Scholar
  4. [4]
    M. A. Bonuccelli and D. P. Bovet, Minimum disjoint path covering for circular arc graphs, Information Processing Letters 8 (1979) 159–161.CrossRefGoogle Scholar
  5. [5]
    M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press 1980.Google Scholar
  6. [6]
    M. C. Golumbic and P. L. Hammer, Stability in circular arc graphs, J. Algorithms 9 (1988), 314–320.CrossRefGoogle Scholar
  7. [7]
    U. I. Gupta, D. T. Lee, J. Y.-T. Leung, Efficient algorithms for interval graphs and circular arc graphs, Networks 12 (1982) 459–467.Google Scholar
  8. [8]
    P. Hell and M. Rosenfeld, The complexity of finding generalized paths in tournaments, J. Algorithms 4 (1983) 303–309.CrossRefGoogle Scholar
  9. [9]
    J. Huang, A result on local tournaments, unpublished manuscript, 1989.Google Scholar
  10. [10]
    D. Knuth, Art of Computer Programming, v.3, Sorting and Searching, Addison-Wesley, 1973.Google Scholar
  11. [11]
    Y. Manoussakis, A linear algorithm for finding hamiltonian cycles in tournaments., Rapport de recherche 488, 1989, Laboratoire de Recherche en Informatique, Universite de Paris — Sud.Google Scholar
  12. [12]
    F. S. Roberts, Indifference graphs, in Proof techniques in Graph Theory (F. Harary ed.), pp. 139–146; Academic Press, 1969.Google Scholar
  13. [13]
    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) 309–316.Google Scholar
  14. [14]
    A. Teng and A. Tucker, An O(qn) algorithm to q-color a proper family of circular arcs, Discrete Math. 55 (1985) 233–243.CrossRefGoogle Scholar
  15. [15]
    A. Tucker, Coloring a family of circular arcs, SIAM J. Appl. Math. 29 (1975) 493–502.CrossRefGoogle Scholar
  16. [16]
    A. Tucker, Structure theorems for some circular arc graphs, Discrete Math. 7 (1974) 167–195.Google Scholar
  17. [17]
    A. Tucker, Matrix characterizations of circular arc graphs, Pacific J. Math. 39 (1971) 535–545.Google Scholar

Copyright information

© Springer-Verlag 1990

Authors and Affiliations

  • Pavol Hell
    • 1
  • Jørgen Bang-Jensen
    • 2
  • Jing Huang
    • 3
  1. 1.School of Computing ScienceSimon Fraser UniversityBurnabyCanada
  2. 2.Department of Computer ScienceUniversity of CopenhagenCopenhagenDenmark
  3. 3.Dept. of Mathematics and StatisticsSimon Fraser UniversityBurnabyCanada

Personalised recommendations