Cantitate/Preț
Produs

Orders, Algorithms and Applications: International Workshop ORDAL '94, Lyon, France, July 4-8, 1994. Proceedings: Lecture Notes in Computer Science, cartea 831

Editat de Vincent Bouchitte, Michel Morvan
en Limba Engleză Paperback – 23 iun 1994
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32879 lei

Preț vechi: 41098 lei
-20% Nou

Puncte Express: 493

Preț estimativ în valută:
6292 6529$ 5259£

Carte tipărită la comandă

Livrare economică 15-29 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540582748
ISBN-10: 3540582746
Pagini: 220
Ilustrații: XI, 209 p.
Dimensiuni: 155 x 233 x 12 mm
Greutate: 0.32 kg
Ediția:1994
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Bit-vector encoding for partially ordered sets.- Intervals and orders: What comes 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, k-sets 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.