Advertisement

Table of contents

  1. Front Matter
    PDF
  2. VC-dimensions for graphs (extended abstract)
    Evangelos Kranakis, Danny Krizanc, Berthold Ruf, Jorge Urrutia, Gerhard J. Woeginger
    Pages 1-13
  3. Finding and counting small induced subgraphs efficiently
    T. Kloks, D. Kratsch, H. Müller
    Pages 14-23
  4. On the isomorphism of graphs with few P4s
    Luitpold Babel, Stephan Olariu
    Pages 24-36
  5. A dynamic algorithm for line graph recognition
    Daniele Giorgio Degiorgi, Klaus Simon
    Pages 37-48
  6. Incremental hive graph
    Fabrizio d'Amore, Roberto Giaccio
    Pages 49-61
  7. Planarization of graphs embedded on surfaces
    Hristo N. Djidjev, Shankar M. Venkatesan
    Pages 62-72
  8. Complexity and approximability of certain bicriteria location problems
    S. O. Krumke, H. Noltemeier, S. S. Ravi, M. V. Marathe
    Pages 73-87
  9. On termination of graph rewriting
    Detlef Plump
    Pages 88-100
  10. A uniform approach to graph rewriting: The pullback approach
    Michel Bauderon
    Pages 101-115
  11. Visualizing two- and three-dimensional models of meristematic growth
    F. David Fracchia
    Pages 116-130
  12. Graph-theoretical methods to construct entity-relationship databases
    Sven Hartmann
    Pages 131-145
  13. An approximation algorithm for 3-Colourability
    Ingo Schiermeyer
    Pages 146-151
  14. The malleability of TSP2Opt
    Sophie Fischer, Leen Torenvliet
    Pages 152-166
  15. Non-oblivious local search for graph and hypergraph coloring problems
    Paola Alimonti
    Pages 167-180
  16. On Interval Routing Schemes and treewidth
    Hans L. Bodlaender, Richard B. Tann, Dimitris M. Thilikos, Jan van Leeuwen
    Pages 181-196
  17. Highly fault-tolerant routings and diameter vulnerability for generalized hypercube graphs
    Koichi Wada, Takaharu Ikeo, Kimio Kawaguchi, Wei Chen
    Pages 197-208
  18. Hot-potato routing on multi-dimensional tori
    Friedhelm Meyer, Matthias Westermann
    Pages 209-221
  19. On devising Boolean Routing schemes
    Michele Flammini, Giorgio Gambosi, Sandro Salomone
    Pages 222-236
  20. Toward a general theory of unicast-based multicast communication
    Barbara D. Birchler, Abdol-Hossein Esfahanian, Eric Torng
    Pages 237-251
  21. Optimal cutwidths and bisection widths of 2- and 3-dimensional meshes
    José Rolim, Ondrej Sýkora, Imrich Vrt'o
    Pages 252-264
  22. Searching for faulty leaves in binary trees
    Peter Damaschke
    Pages 265-274
  23. NC algorithms for partitioning planar graphs into induced forests and approximating NP-hard problems
    Zhi-Zhong Chen, Xin He
    Pages 275-289
  24. Efficient parallel modular decomposition (extended abstract)
    Elias Dahlhaus
    Pages 290-302
  25. Modular decomposition of hypergraphs
    P. Bonizzoni, G. Della Vedova
    Pages 303-317
  26. Partition coefficients of acyclic graphs
    John L. Pfaltz
    Pages 318-332
  27. Sub-cubic cost algorithms for the all pairs shortest path problem
    Tadao Takaoka
    Pages 333-343
  28. Diametral path graphs
    J. S. Deogun, D. Kratsch
    Pages 344-357
  29. Chordal graphs and their clique graphs
    Philippe Galinier, Michel Habib, Christophe Paul
    Pages 358-371
  30. A compact data structure and parallel algorithms for permutation graphs
    Jens Gustedt, Michel Morvan, Laurent Viennot
    Pages 372-380
  31. Homogeneously orderable graphs and the Steiner tree problem
    Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai
    Pages 381-395
  32. Back Matter
    PDF

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 21st International Workshop on Graph-Theoretic Concepts in Computer Science, WG '95, held in Aachen, Germany, in June 1995. The WG workshop series contributes to integration in computer science by applying graph theoretical concepts in various areas as well as by taking up problems from practical applications and treating them theoretically.
The book presents 30 carefully refereed revised papers selected from 52 submissions and reflects current activities in the field of computer science oriented graph theory, its computational aspects and its application.

Keywords

Coloured Graphs Graph Graph Algorithms Graph Computations Graph theory Graphalgorithmen Graphentheoretische Berechnungen computer computer science graph Ttransfomrations graphtransformationen

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-60618-1
  • Copyright Information Springer-Verlag Berlin Heidelberg 1995
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-60618-5
  • Online ISBN 978-3-540-48487-5
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site