Table of contents

  1. Front Matter
  2. Sotiris E. Nikoletseas, Paul G. Spirakis
    Pages 1-10
  3. M. V. Marathe, V. Radhakrishnan, H. B. Hunt III, S. S. Ravi
    Pages 21-32
  4. Egon Wanke
    Pages 33-44
  5. Martin Charles Golumbic, Haim Kaplan, Ron Shamir
    Pages 57-69
  6. Alberto Marchetti-Spaccamela, Umberto Nanni, Hans Rohnert
    Pages 70-86
  7. Paola Alimonti, Stefano Leonardi, Alberto Marchetti-Spacccamela, Xavier Messeguer
    Pages 87-98
  8. Zoran Ivković, Errol L. Lloyd
    Pages 99-111
  9. Hans L. Bodlaender
    Pages 112-124
  10. Andreas Brandstädt, Heinz-Jürgen Voss
    Pages 125-131
  11. Zbigniew Lonc
    Pages 144-152
  12. George Havas, Bohdan S. Majewski, Nicholas C. Wormald, Zbigniew J. Czech
    Pages 153-165
  13. Derek. G. Corneil, Stephan Olariu, Lorna Stewart
    Pages 211-224

About these proceedings

Introduction

This volume contains the proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science, WG '93, held near Utrecht, The Netherlands, in 1993.
The papers are grouped into parts on: hard problems on classes of graphs, structural graph theory, dynamic graph algorithms, structure-oriented graph algorithms, graph coloring, AT-free and chordal graphs, circuits and nets, graphs and interconnection networks, routing and shortest paths, and graph embedding and layout.
The 35 revised papers were chosen from 92 submissions after a careful refereeing process.

Keywords

Graph Graph-Algorithmen Kombinatorische Algorithmen Layout algorithm algorithms combinatorial algorithms distributed algorithms graph algorithms graph theory network theory

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-57899-4
  • Copyright Information Springer-Verlag 1994
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-57899-4
  • Online ISBN 978-3-540-48385-4
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book