Skip to main content
  • Conference proceedings
  • © 1993

Graph-Theoretic Concepts in Computer Science

18th International Workshop, WG '92, Wiesbaden-Naurod, Germany, June 18-20, 1992. Proceedings


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

Buying options

Softcover Book USD 109.00
Price excludes VAT (USA)

This is a preview of subscription content, access via your institution.

Table of contents (29 papers)

  1. Front Matter

  2. A simple test for interval graphs

    • Wen-Lian Hsu
    Pages 11-16
  3. Tolerance graphs and orders

    • Stefan Felsner
    Pages 17-26
  4. Scheduling with incompatible jobs

    • Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger
    Pages 37-49
  5. Generalized coloring for tree-like graphs

    • Klaus Jansen, Petra Scheffler
    Pages 50-59
  6. Improved algorithms for routing on two-dimensional grids

    • Dinesh Bhatia, Tom Leighton, Fillia Makedon, Carolyn H. Norton
    Pages 114-122
  7. On assembly of four-connected graphs

    • Jianer Chen, Arkady Kanevsky
    Pages 158-169
  8. On the homogeneous decomposition of graphs

    • Beverly Jamison, Stephan Olariu
    Pages 170-183
  9. Embeddings in recursive combinatorial networks

    • Sajal K. Das, Aisheng Mao
    Pages 184-204
  10. On shortcutting digraphs

    • Mikkel Thorup
    Pages 205-211

About this book

The 18th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '92) was held in Wiesbaden-Naurod, Germany, June 18-20, 1992. Itwas organized by the Department of Computer Science, Johann Wolfgang Goethe University, Frankfurt am Main. Contributions with original results inthe study and application of graph-theoretic concepts in various fields of computer science were solicited, and 72 papers were submitted and reviewed, from which 29 were selected for presentation at the workshop. The workshop was attended by 61 scientists from 16 countries. All 29 papers in the volume have undergone careful revision after the meeting, based on the discussions and comments from the audience and the referees. The volume is divided into parts on restricted graph classes, scheduling and related problems, parallel anbd distributed algorithms, combinatorial graph problems, graph decomposition, graph grammars and geometry, and modelling by graphs.


  • Combinatorial Algorithms
  • Distributed Algorithms
  • Graph
  • Graph-Theeory
  • Kombinatorische Algorithmen
  • Programmier-Semantik
  • Scheduling
  • Semantics of Programming
  • algorithm
  • algorithms
  • modeling
  • algorithm analysis and problem complexity
  • combinatorics

Bibliographic Information

Buying options

Softcover Book USD 109.00
Price excludes VAT (USA)