Order

, Volume 8, Issue 1, pp 49–61 | Cite as

Cycle-free partial orders and chordal comparability graphs

  • Tze-Heng Ma
  • Jeremy P. Spinrad
Article

Abstract

This paper studies a number of problems on cycle-free partial orders and chordal comparability graphs. The dimension of a cycle-free partial order is shown to be at most 4. A linear time algorithm is presented for determining whether a chordal directed graph is transitive, which yields an O(n2) algorithm for recognizing chordal comparability graphs. An algorithm is presented for determining whether the transitive closure of a digraph is a cycle-free partial order in O(n+mt)time, where mtis the number of edges in the transitive closure.

AMS subject classifications (1991)

Primary 06A06 secondary 05C20 68Q25 

Key words

Partial order cycle-free poset chordal comparability graph poset dimension algorithm transitive closure 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. V.Aho, J. E.Hopcroft, and J. D.Ullman (1974) The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA.Google Scholar
  2. 2.
    V.Bouchitte and M.Habib (1989) The Calculation of Invariants for Ordered Sets, in Algorithms and Order, ed. I.Rival, Kluwer, Dordrecht, pp. 231–279.Google Scholar
  3. 3.
    P.Buneman (1974) A Characterization of Rigid Circuit Graphs, Discrete Math. 9, 205–212.Google Scholar
  4. 4.
    D. Coppersmith and S. Winograd (1987) Matrix Multiplication via Arithmetic Progressions, Proceedings of the 19th Annual IEEE Symposium on the Foundations of Computer Science, 1–6.Google Scholar
  5. 5.
    B.Dushnick and E. W.Miller (1941) Partially Ordered Sets, Amer. J. Math. 63, 600–610.Google Scholar
  6. 6.
    D.Duffus, I.Rival and P.Winkler (1982), Minimizing Setups for Cycle-Free Ordered Sets, Proc. Amer. Math. Soc. 85, 509–513.Google Scholar
  7. 7.
    M. C.Golumbic (1980) Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York.Google Scholar
  8. 8.
    R. H.Möhring (1989) Computationally Tractable Classes of Ordered Sets, in Algorithms and Order, ed. I.Rival, Kluwer, Dordrecht, pp. 105–194.Google Scholar
  9. 9.
    W. R. Pulleyblank (1982) Alternating Cycle-Free Matchings, CORR Report 82-18, Department of Combinatorics and Optimization, University of Waterloo.Google Scholar
  10. 10.
    J. Qin and W. T. Trotter (1990) personal communication.Google Scholar
  11. 11.
    D. J.Rose, R. E.Tarjan, and G. S.Leuker (1976) Algorithmic Aspects of Vertex Elimination on Graphs, SIAM J. Computing 5, 266–283.Google Scholar
  12. 12.
    J.Spinrad (1985) On Comparability and Permutation Graphs, SIAM J. of Computing 14, 658–670.Google Scholar
  13. 13.
    W. T.Trotter and J. I.Moore (1977) The Dimension of Planar Posets, Journal of Combinatorial Theory Series B 22, 54–67.Google Scholar
  14. 14.
    R. E.Tarjan and M.Yannakakis (1984) Simple Linear Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs, SIAM J. of Computing 23, 566–579.Google Scholar

Copyright information

© Kluwer Academic Publishers 1991

Authors and Affiliations

  • Tze-Heng Ma
    • 1
  • Jeremy P. Spinrad
    • 2
  1. 1.Institute of Information ScienceAcademia SinicaTaipeiPeople's Republic of China
  2. 2.Department of Computer ScienceVanderbilt UniversityNashvilleUSA

Personalised recommendations