Orders, Algorithms and Applications: International Workshop ORDAL '94, Lyon, France, July 4-8, 1994. Proceedings

Front Cover
Springer Science & Business Media, Jun 23, 1994 - Computers - 204 pages
0 Reviews
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.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Selected pages

Contents

BitVector Encoding for Partially Ordered Sets
1
What Conies After Interval Orders?
13
Dimension and Algorithms
33
Upward Drawings to Fit Surfaces
53
A Cleanup on Transitive Orientation
59
A Characterization of Graphs with Vertex Cover up to Five
86
Testing hereditary properties efficiently on average
100
Orders ksets and Fast Halfplane Search on Paged Memory
117
Triangle Graphs and Their Coloring
128
Representation of an Order as Union of Interval Orders
143
Minimal Representation of Semiorders with Intervals of Same Length
162
The Computation of the Jump Number of Convex Graphs
176
Fast Lattice Browsing on Sparse Representation
186
Copyright

Common terms and phrases

Popular passages

Page 203 - Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries", Proc.
Page 50 - Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, 1993, pp.

Bibliographic information