Amazon cover image
Image from Amazon.com

Orders, algorithms, and applications : International Workshop ORDAL '94, Lyon, France, July 4-8, 1994 : proceedings / Vincent Bouchitté, Michel Morvan, eds.

By: Contributor(s): Material type: TextTextLanguage: English Summary language: French Series: Lecture notes in computer science ; 831.Publication details: Berlin ; New York : Springer-Verlag, ©1994.Description: 1 online resource (204 pages) : illustrationsContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 3540582746
  • 9783540582748
  • 0387582746
  • 9780387582740
  • 9783540485971
  • 354048597X
Subject(s): Genre/Form: Additional physical formats: Print version:: Orders, algorithms, and applications.DDC classification:
  • 511.3/3 20
LOC classification:
  • QA171.48 .I56 1994
Online resources:
Contents:
Bit-Vector Encoding for Partially Ordered Sets / M. Habib and L. Nourine -- Intervals and Orders: What Comes After Interval Orders? / K.P. Bogart -- Dimension and Algorithms / J. Spinrad -- Upward Drawings to Fit Surfaces / S.M. Hashemi and I. Rival -- A Cleanup on Transitive Orientation / K. Simon and P. Trunz -- A Characterization of Graphs with Vertex Cover up to Five / K. Cattel and M.J. Dinneen -- Testing Hereditary Properties Efficiently on Average / J. Gustedt and A. Steger -- Orders, k-sets and Fast Halfplane Search on Paged Memory / P.G. Franciosa and M. Talamo -- Triangle Graphs and Their Coloring / Y.-L. Lin -- Representation of an Order as Union of Interval Orders / C. Capelle -- Minimal Representation of Semiorders with Intervals of Same Length / J. Mitas -- The Computation of the Jump Number of Convex Graphs / E. Dahlhaus -- Fast Lattice Browsing on Sparse Representations / M. Talamo and P. Vocca.
Summary: 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.
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library eBook LNCS Available
Total holds: 0

Summary in French.

Includes bibliographical references.

Bit-Vector Encoding for Partially Ordered Sets / M. Habib and L. Nourine -- Intervals and Orders: What Comes After Interval Orders? / K.P. Bogart -- Dimension and Algorithms / J. Spinrad -- Upward Drawings to Fit Surfaces / S.M. Hashemi and I. Rival -- A Cleanup on Transitive Orientation / K. Simon and P. Trunz -- A Characterization of Graphs with Vertex Cover up to Five / K. Cattel and M.J. Dinneen -- Testing Hereditary Properties Efficiently on Average / J. Gustedt and A. Steger -- Orders, k-sets and Fast Halfplane Search on Paged Memory / P.G. Franciosa and M. Talamo -- Triangle Graphs and Their Coloring / Y.-L. Lin -- Representation of an Order as Union of Interval Orders / C. Capelle -- Minimal Representation of Semiorders with Intervals of Same Length / J. Mitas -- The Computation of the Jump Number of Convex Graphs / E. Dahlhaus -- Fast Lattice Browsing on Sparse Representations / M. Talamo and P. Vocca.

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.

Print version record.

Powered by Koha