Skip to main content
Springer Nature Link
Log in

Graph-Theoretic Concepts in Computer Science

21st International Workshop, WG '95, Aachen, Germany, June 20 - 22, 1995. Proceedings

  • Conference proceedings
  • © 1995
Save conference proceedings
View saved research

Overview

Editors:
  1. Manfred Nagl

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

Included in the following conference series:

Conference proceedings info: WG 1995.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Free shipping worldwide - view details

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

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.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, books and news in related subjects.

Table of contents (30 papers)

  1. Front Matter

    Download chapter 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 TSP 2Opt

    • 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
Back to top

Other volumes

  1. Graph-Theoretic Concepts in Computer Science

Accessibility Information

Accessibility information for this book is coming soon. We're working to make it available as quickly as possible. Thank you for your patience.

Bibliographic Information

Keywords

Publish with us

Policies and ethics

Back to top