Skip to main content
SpringerLink
Log in
Book cover

Orders, Algorithms and Applications

International Workshop ORDAL '94, Lyon, France, July 4-8, 1994. Proceedings

  • Conference proceedings
  • © 1994

Overview

Editors:
  1. Vincent Bouchitté
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Michel Morvan
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 831)

Included in the following conference series:

Conference proceedings info: ORDAL 1994.

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

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (13 papers)

  1. Front Matter

    Download chapter PDF

  2. Bit-vector encoding for partially ordered sets

    • Michel Habib, Lhouari Nourine
    Pages 1-12

  3. Intervals and orders: What comes after interval orders?

    • Kenneth P. Bogart
    Pages 13-32

  4. Dimension and algorithms

    • J. Spinrad
    Pages 33-52

  5. Upward drawings to fit surfaces

    • S. Mehdi Hashemi, Ivan Rival
    Pages 53-58

  6. A cleanup on transitive orientation

    • Klaus Simon, Paul Trunz
    Pages 59-85

  7. A characterization of graphs with vertex cover up to five

    • Kevin Cattell, Michael J. Dinneen
    Pages 86-99

  8. Testing hereditary properties efficiently on average

    • Jens Gustedt, Angelika Steger
    Pages 100-116

  9. Orders, k-sets and fast halfplane search on paged memory

    • Paolo G. Franciosa, Maurizio Talamo
    Pages 117-127

  10. Triangle graphs and their coloring

    • Yaw -Ling Lin
    Pages 128-142

  11. Representation of an order as union of interval orders

    • Christian Capelle
    Pages 143-161

  12. Minimal representation of semiorders with intervals of same length

    • Jutta Mitas
    Pages 162-175

  13. The computation of the jump number of convex graphs

    • Elias Dahlhaus
    Pages 176-185

  14. Fast lattice browsing on sparse representation

    • Maurizio Talamo, Paola Vocca
    Pages 186-204

  15. Back Matter

    Download chapter PDF
Back to top

Other volumes

  1. Orders, Algorithms, and Applications

Keywords

About this book

This volume is the proceedings of the first International Workshop on Orders, Algorithms, and Applications, held at Lyon, France in July 1994.
Ordered sets and the more specifically algorithmic aspects of order theory are of increasing importance, for example in graph theory. They enjoy a recognized place in computer science as well as in mathematics, due to various new developments in the last few years. The nine technical papers accepted for this volume and the four invited papers presented offer a representative perspective on theoretical and applicational aspects of orders and related algorithms.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation