Skip to main content
SpringerLink
Log in

Graphical Data Structures for Ordered Sets

  • Chapter
Algorithms and Order

Part of the book series: NATO ASI Series ((ASIC,volume 255))

Abstract

Ordered sets occur widely in computation, in scheduling, in sorting, in social choice, and even in geography. For some years research on these themes has focussed first on combinatorial optimization and then on “algorithmics”. Important advances have been made both at practical and, at theoretical levels. There is little doubt that the modern mathematical theory of ordered sets owes much of its vitality to these recent developments. While some of the problems remain exceedingly difficult, such as the “three-machine scheduling problem”, attention is shifting from the usual optimization themes to data structures; indeed, there is emerging a need for efficient data structures to code and store ordered sets. Among these data structures, graphical ones are coming to play a decisive role, for instance, in problems in which decisions must be made from among alternatives ranked according to precedence or preference relations.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 349.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 449.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 449.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • F. Al-Thukair, A. Pelc, I. Rival and J. Urrutia (1988) Motion planning, two-directional point representations, and ordered sets, preprint.

    Google Scholar 

  • K.A. Baker, P.C. Fishburn and F.S. Roberts (1971) Parital orders of dimension 2, Networks 2, 11–28.

    Article  MathSciNet  Google Scholar 

  • H.-J. Bandelt (1984) Retracts of hypercubes, J. Graph Theory 8, 501–510.

    Article  MathSciNet  MATH  Google Scholar 

  • H.-J. Bandelt and I. Rival (1988) Diagrams, orientations, and varieties, preprint

    Google Scholar 

  • G. di Battista and R. Tamassia (1987) Algorithms for plane representations of acyclic digraphs, Theoritical Computer Science, to appear.

    Google Scholar 

  • B. Chazelle, T. Ottmann, E. Soisalon-Soinen and D. Wood (1983) The complexity and decidability of separation, Tech. Report CS-83–84, University of Waterloo.

    Google Scholar 

  • J. Czyzowicz, A. Pelc and I. Rival (1988) Drawing orders with few slopes, Discrete Math., to appear.

    Google Scholar 

  • J. Czyzowicz, A. Pelc, I. Rival and Urrutia (1987) Crooked diagrams with few slopes, preprint.

    Google Scholar 

  • R. Dawson (1984) On removing a ball without disturbing the others, Math. Mag. 57, 27–30.

    Article  MathSciNet  MATH  Google Scholar 

  • R.P. Dilworth (1950) A decomposition theorem for partially ordered sets, Ann. Math. 51, 161–165.

    Article  MathSciNet  MATH  Google Scholar 

  • D. Duffus and I. Rival (1981) A structure theory for ordered sets, Discrete Math. 35, 53–118.

    Article  MathSciNet  MATH  Google Scholar 

  • D. Duffus and I. Rival (1983) Graphs orientable as distributive lattices, Proc. Amer. Math. Soc. 88, 197–200.

    Article  MathSciNet  MATH  Google Scholar 

  • I. Fary (1948) On straight line representation of planar graphs, Acta. Sci. Math. Szeged 11, 229–233.

    MathSciNet  Google Scholar 

  • T. Gallai (1967) Transitiv orientierbare Graphen, Acta Math. Acad. Sci. Hungar 18, 25–66.

    Article  MathSciNet  MATH  Google Scholar 

  • M.C. Golumbic (1980) Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York.

    MATH  Google Scholar 

  • L. Guibas and F.F. Yao (1980) On translating a set of rectangles, Proc. 12th Annual ACM Symposium “Theory of Computing”, 154–216.

    Google Scholar 

  • M. Habib (1984) Comparability invariants, in Ordres: Description et Rôles(eds. M. Pouzet and D. Richard), Ann. Discrete Math. 23, North-Holland, Amsterdam, pp. 371–386.

    Google Scholar 

  • J. Hopcroft and R.E. Tarjan (1974) Efficient planarity testing, J. ACM 21, 549–568.

    Article  MathSciNet  MATH  Google Scholar 

  • R. Jégou, R. Nowakowski and I. Rival (1987) The diagram invariant problem for planar lattices, Acta Sci. Math (Szeged) 51, 103–121.

    MATH  Google Scholar 

  • D. Kelly (1977) The 3-irreducible partially ordered sets, Canad. J. Math. 29, 367–383.

    Article  MathSciNet  MATH  Google Scholar 

  • D. Kelly (1985) Comparability graphs, in Graphs and Order (ed. I. Rival), Reidel, Dordrecht, pp. 3–40.

    Google Scholar 

  • D. Kelly (1987) Fundamentals of planar ordered sets, Discrete Math. 63, 197–216.

    Article  MathSciNet  MATH  Google Scholar 

  • D. Kelly and I. Rival (1975) Planar lattices, Canad. J. Math. 27, 636–665.

    Article  MathSciNet  MATH  Google Scholar 

  • W.P. Liu and I. Rival (1988a) Inversions, cuts and orientations, Discrete Math., to appear.

    Google Scholar 

  • W.P. Liu and I. Rival (1988b) Enumerating orientations of ordered sets, preprint.

    Google Scholar 

  • M. Mansouri and G.T. Toussaint (1985) Translation queries for convex polygons, Proc. IASTED Internat. Sympos. ‘Robotics and Automation’, Lugano.

    Google Scholar 

  • R.H. Möhring (1985) Algorithmic aspects of comparability graphs, in Graphs and Order (ed. I. Rival), Reidel, Dordrecht, pp. 41–101.

    Google Scholar 

  • K.M. Mosesjan (1972) Basable and strongly basable graphs, (in Russian), Dokl. Akad. Nauk. Armjan. SSR, 55, 83–86.

    MathSciNet  MATH  Google Scholar 

  • J. Nesetril and V. Rödl (1987) The complexity of diagrams Order 3, 321–330.

    Article  MathSciNet  Google Scholar 

  • R. Nowakowski and I. Rival (1988) Embedding orders along three channels, preprint.

    Google Scholar 

  • R. Nowakowski, I. Rival and J. Urrutia (1988) Lattices contained in planar orders are planar, to appear.

    Google Scholar 

  • R. Nowakowski, I. Rival and J. Urrutia (1988) Representing orders on the plane by translating points and lines, Discrete Math., to appear.

    Google Scholar 

  • A. Pele and I. Rival (1987) Orders with level diagrams, preprint.

    Google Scholar 

  • C.R. Platt (1976) Planar lattices and planar graphs, J. Combin. Th. Ser. B. 21, 30–39.

    Article  MathSciNet  MATH  Google Scholar 

  • O. Pretzel (1985) On graphs that can be oriented as diagrams of ordered sets, Orders 2, 25–40.

    Article  MathSciNet  MATH  Google Scholar 

  • O. Pretzel (1986) On reorienting graphs by pushing down maximal vertices, Order 3, 135–153.

    Article  MathSciNet  MATH  Google Scholar 

  • I. Rival (1984) Linear extensions of finite ordered sets, in Ordres: Description et Rôles (eds. M. Pouzet and D. Richaid)Ann. Discrete Math. 23, 355–370.

    Google Scholar 

  • I. Rival (1985) The diagram, in Graphs and Order (ed. I. Rival, Reidel, Dordrecht, pp. 103–133.

    Google Scholar 

  • I. Rival and J. Urrutia (1988) Representing orders on the plane by translating convex figures, Order 4, 319–339.

    Article  MathSciNet  MATH  Google Scholar 

  • I. Rival and N. Zaguia (1985) Antichain cutsets, Order 1, 235–247.

    Article  MathSciNet  MATH  Google Scholar 

  • J.R. Sack and G.T. Toussaint (1985) Translating polygons in the plane, Proc. STACS, Saarbrücken, pp. 310–321.

    Google Scholar 

  • J. Stephan (1988), preprint, Technische Hochschule Darmstadt.

    Google Scholar 

  • R. Tamassia (1987) On embedding a graph in the grid with the minimum number of bends, SIAM Journal on Computing 16, 421–443.

    Article  MathSciNet  MATH  Google Scholar 

  • G.T. Toussaint (1985) Movable separability of sets, in Computational Geometry (ed. G.T. Toussaint), North-Holland, Amsterdam, pp. 335–376.

    Google Scholar 

  • G.X. Viennot (1985) Problèmes combinatoires posés par la physique statistique, Séminaire Bourbaki, No. 626. in Astérisque, No. 121–122, 225–246.

    MathSciNet  Google Scholar 

  • K. Wagner (1936) Bemerkungen Zum Vierfarbenproblem, Jber. Deutsch. Math.-Verein. 46, 26–32.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of Ottawa, Ottawa, Ontario, Canada, K1N 6N5

    Ivan Rival

Authors
  1. Ivan Rival
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departments of Computer Science and Mathematics, University of Ottawa, Ottawa, Canada

    Ivan Rival

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Kluwer Academic Publishers

About this chapter

Cite this chapter

Rival, I. (1989). Graphical Data Structures for Ordered Sets. In: Rival, I. (eds) Algorithms and Order. NATO ASI Series, vol 255. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-2639-4_1

Download citation

  • DOI: https://doi.org/10.1007/978-94-009-2639-4_1

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-7691-3

  • Online ISBN: 978-94-009-2639-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation