Advertisement

Contiguity orders

  • Vincent Bouchitté
  • Abdelmajid Hilali
  • Roland Jégou
  • Jean-Xavier Rampon
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1120)

Abstract

This paper is devoted to the study of contiguity orders i.e. orders having a linear extension L such that all upper (or lower) cover sets are intervals of L. This new class appears to be a strict generalization of both interval orders and N-free orders, and is linearly recognizable. It is proved that computing the number of contiguity extensions is #P-complete, and that the dimension of height one contiguity orders is polynomially tractable. Moreover the membership is a comparability invariant on bi-contiguity orders.

Keywords

Total Order Linear Extension Interval Order Hasse Diagram Irreducible Element 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    K.S. Booth, G.S. Lueker, Testing for the Consecutive Ones Property, Interval Graphs and Graph Planarity Using PQ-Tree Algorithms. Journal of Computer and System Science 13, 335–379 (1976).Google Scholar
  2. 2.
    V. Bouchitté, R. Jégou, J.X. Rampon, Ordres représentables par des translations de segments dans le plan. C.R. Acad. Sci. Paris, t. 315, Série I, p. 1427–1430, 1992.Google Scholar
  3. 3.
    V. Bouchitté, R. Jégou, J.X. Rampon, Line-Directionality of Orders. Order 10: 17–30, 1993.CrossRefGoogle Scholar
  4. 4.
    A. Brandstädt, The Jump Number Problem for Biconvex Graphs and Rectangle Covers of Rectangular Regions. Lecture Notes in Computer Science N∘ 380, pp. 68–77, Springer-Verlag 1990.Google Scholar
  5. 5.
    G. Brightwell, P. Winkler Counting Linear Extensions. Order 8: 225–242, 1991.CrossRefGoogle Scholar
  6. 6.
    E. Dahlhaus, The Computation of the Jump Number of Convex Graphs. Lecture Notes in Computer Science N∘ 831, pp. 176–185, Springer-Verlag 1994.Google Scholar
  7. 7.
    B. Dreesen, W. Poguntke, P. Winkler Comparability Invariance of the Fixed Point Property. Order 2: 269–274, 1985.Google Scholar
  8. 8.
    P. Duchet, Représentations, noyaux en théorie des graphes et hypergraphes. Doctorat d'État ès Science Paris VI, 1979.Google Scholar
  9. 9.
    M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979.Google Scholar
  10. 10.
    M. Habib, R. Jégou, N-free Posets as Generalizations of Series-Parallel Posets. Discrete Applied Mathematics 12 (1985) 279–291.CrossRefGoogle Scholar
  11. 11.
    D. Kelly, Comparability Graphs. I. Rival (ed.), Graphs and Order, 3–40. 1985 by D.Reidel Publishing Company.Google Scholar
  12. 12.
    D. Kelly, I. Rival, Planar Lattices. Canadian Journal of Mathematics, Vol. XXVII N∘ 3, (1975), 636–665.Google Scholar
  13. 13.
    H.A. Kierstead, S.G. Penrice, Computing the Dimension of N-Free Ordered Sets is NP-complete. Order 6: 133–136, 1989.CrossRefGoogle Scholar
  14. 14.
    J. Mitas, Tackling the Jump Number of Interval Orders. Order 8: 115–132. 1991.CrossRefGoogle Scholar
  15. 15.
    R.H. Möhring, Computationally Tractable Classes of Ordered Sets. I. Rival (ed.), Algorithms and Order, 105–193. 1989 by Kluwer Academic Publishers.Google Scholar
  16. 16.
    A. Quilliot, S.X. Chao, Algorithmic Characterizations of Interval Ordered Hypergraphs and Applications. Discrete Applied Mathematics 51 (1994) 159–170.CrossRefGoogle Scholar
  17. 17.
    I. Rival et J. Urrutia, Representing Orders on the Plane by Translating Convex Figures. Order 4: 319–339, 1988.CrossRefGoogle Scholar
  18. 18.
    J. Spinrad, On Comparability and Permutation Graphs. SIAM Journal of Computing Vol. 14, N∘ 3, August 1985, 658–670.MathSciNetGoogle Scholar
  19. 19.
    J. Spinrad, Private communication.Google Scholar
  20. 20.
    J. Spinrad, A. Brandstädt, L. Stewart, Bipartite Permutation Graphs. Discrete Applied Mathematics 18 (1987) 279–292.CrossRefGoogle Scholar
  21. 21.
    W.T. Trotter, Combinatorics and Partially Ordered Sets, Dimension Theory. The Johns Hopkins University Press, 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Vincent Bouchitté
    • 1
  • Abdelmajid Hilali
    • 2
  • Roland Jégou
    • 3
  • Jean-Xavier Rampon
    • 4
  1. 1.LIP, CNRS URA 1398Ecole Normale Supérieure de LyonLyon Cédex 07France
  2. 2.Groupe L.M.D.I.-I.M.I.Université Claude Bernard-Lyon 1Villeurbanne CédexFrance
  3. 3.Centre SIMADEEcole des Mines de Saint-EtienneSaint-Etienne Cédex 2France
  4. 4.IRISARennes CédexFrance

Personalised recommendations