Orders, Algorithms, and Applications

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

  • Editors
  • Vincent Bouchitté
  • Michel Morvan
Conference proceedings

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

Table of contents

  1. Front Matter
  2. Michel Habib, Lhouari Nourine
    Pages 1-12
  3. J. Spinrad
    Pages 33-52
  4. S. Mehdi Hashemi, Ivan Rival
    Pages 53-58
  5. Klaus Simon, Paul Trunz
    Pages 59-85
  6. Kevin Cattell, Michael J. Dinneen
    Pages 86-99
  7. Jens Gustedt, Angelika Steger
    Pages 100-116
  8. Paolo G. Franciosa, Maurizio Talamo
    Pages 117-127
  9. Yaw -Ling Lin
    Pages 128-142
  10. Maurizio Talamo, Paola Vocca
    Pages 186-204
  11. Back Matter

About these proceedings

Introduction

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.

Keywords

Algorithmen Geordnete Strukturen Kombinatorik ORDAL Ordnungen algorithm algorithms combinatorics graph theory ordered structures orders sets

Bibliographic information

  • DOI https://doi.org/10.1007/BFb0019422
  • Copyright Information Springer-Verlag 1994
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-58274-8
  • Online ISBN 978-3-540-48597-1
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book
Industry Sectors
Electronics
Telecommunications
Biotechnology