Skip to main content
  • Conference proceedings
  • © 1994

Graph-Theoretic Concepts in Computer Science

19th International Workshop, WG '93, Utrecht, The Netherlands, June 16 - 18, 1993. Proceedings


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

Conference series link(s): WG: International Workshop on Graph-Theoretic Concepts in Computer Science

Conference proceedings info: WG 1993.

Buying options

Softcover Book USD 119.00
Price excludes VAT (USA)

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

Table of contents (35 papers)

  1. Front Matter

  2. Near-optimal dominating sets in dense random graphs in polynomial expected time

    • Sotiris E. Nikoletseas, Paul G. Spirakis
    Pages 1-10
  3. Hierarchically specified unit disk graphs

    • M. V. Marathe, V. Radhakrishnan, H. B. Hunt III, S. S. Ravi
    Pages 21-32
  4. Bounded tree-width and LOGCFL

    • Egon Wanke
    Pages 33-44
  5. Algorithms and complexity of sandwich problems in graphs (extended abstract)

    • Martin Charles Golumbic, Haim Kaplan, Ron Shamir
    Pages 57-69
  6. On-line graph algorithms for incremental compilation

    • Alberto Marchetti-Spaccamela, Umberto Nanni, Hans Rohnert
    Pages 70-86
  7. Average case analysis of fully dynamic connectivity for directed graphs

    • Paola Alimonti, Stefano Leonardi, Alberto Marchetti-Spacccamela, Xavier Messeguer
    Pages 87-98
  8. Fully dynamic maintenance of vertex cover

    • Zoran Ivković, Errol L. Lloyd
    Pages 99-111
  9. Dynamic algorithms for graphs with treewidth 2

    • Hans L. Bodlaender
    Pages 112-124
  10. Short disjoint cycles in graphs with degree constraints

    • Andreas Brandstädt, Heinz-Jürgen Voss
    Pages 125-131
  11. Towards a solution of the Holyer's problem

    • Zbigniew Lonc
    Pages 144-152
  12. Graphs, hypergraphs and hashing

    • George Havas, Bohdan S. Majewski, Nicholas C. Wormald, Zbigniew J. Czech
    Pages 153-165
  13. Asteroidal triple-free graphs

    • Derek. G. Corneil, Stephan Olariu, Lorna Stewart
    Pages 211-224

Other Volumes

  1. Graph-Theoretic Concepts in Computer Science

About this book

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.


  • Graph
  • Graph-Algorithmen
  • Kombinatorische Algorithmen
  • Layout
  • algorithm
  • algorithms
  • combinatorial algorithms
  • distributed algorithms
  • graph algorithms
  • graph theory
  • network theory
  • algorithm analysis and problem complexity
  • combinatorics

Bibliographic Information

Buying options

Softcover Book USD 119.00
Price excludes VAT (USA)