Orders, Algorithms and Applications: International Workshop ORDAL '94, Lyon, France, July 4-8, 1994. Proceedings
Springer Science & Business Media, Jun 23, 1994 - Computers - 204 pages
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.
BitVector Encoding for Partially Ordered Sets
What Conies After Interval Orders?
Dimension and Algorithms
Upward Drawings to Fit Surfaces
A Cleanup on Transitive Orientation
A Characterization of Graphs with Vertex Cover up to Five
Testing hereditary properties efficiently on average
Orders ksets and Fast Halfplane Search on Paged Memory
Triangle Graphs and Their Coloring
Representation of an Order as Union of Interval Orders
Minimal Representation of Semiorders with Intervals of Same Length
The Computation of the Jump Number of Convex Graphs
Fast Lattice Browsing on Sparse Representation
adjacent admissible tuples algorithm alternating cycle free antichains arcs bipartite graphs bit-vector encoding called Clus(c cluster code(x cograph comparability graph contains cotree cycle free matching data structure decomposition defined denote dimension dimensional partial orders DM(P edges efficient elements endpoints given Golumbic graph G halfplane implication class implies independent set induced subgraph input integer intersection interval graph interval orders interval restriction interval tolerance orders isomorphic jump number Lemma linear extension loop maximal maximum clique minimal module NP-complete obstruction set optimal ordered set pairs partial lattice partition pathwidth permutation graphs polynomial poset priority queue problem Proceedings Proof Proposition representing result right border right most sequence semiorder simple trapezoid graph Spinrad suborder subset Theorem theory tolerance graph transitive closure transitive orientation transitive reduction tree treewidth triangle graphs unit interval unit interval representation upward drawing VC-k vertex cover vertices Vm(S