Graph-Theoretic Concepts in Computer Science

This book constitutes the strictly refereed post-workshop proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science, WG'97, held in Berlin, Germany in June 1997.
The volume presents 28 revised full papers carefully selected for inclusion in the book from 42 submissions. The papers address a variety of graph-theoretic issues relevant from the computer science point of view such as graph algorithms, cycles, graph decompositions, interconnection networks, local search, graph orderings, graph matching, graph languages, tree-width computation, etc.

Inhalt
Gadgets, approximation, and linear programming: Improved hardness results for cut and satisfiability problems.- Non-oblivious local search for MAX 2-CCSP with application to MAX DICUT.- On the number of simple cycles in planar graphs.- On the separable-homogeneous decomposition of graphs.- Pseudo-hamiltonian graphs.- Acyclic orientations for deadlock prevention in interconnection networks.- Weak-order extensions of an order.- An upper bound for the maximum cut mean value.- NP-completeness results for minimum planar spanners.- Computing the independence number of dense triangle-free graphs.- Algorithms for the treewidth and minimum fill-in of HHD-free graphs.- Block decomposition of inheritance hierarchies.- Minimal elimination ordering inside a given chordal graph.- On-line algorithms for networks of temporal constraints.- Parallel algorithms for treewidth two.- On optimal graphs embedded into paths and rings, with analysis using l 1-spheres.- On greedy matching ordering and greedy matchable graphs.- Off-line and on-line call-scheduling in stars and trees.- Computational complexity of the Krausz dimension of graphs.- Asteroidal sets in graphs.- Complexity of colored graph covers I. Colored directed multigraphs.- A syntactic approach to random walks on graphs.- Bicliques in graphs II: Recognizing k-path graphs and underlying graphs of line digraphs.- Large networks with small diameter.- The bounded tree-width problem of context-free graph languages.- Structured programs have small tree-width and good register allocation.- A measure of parallelization for the lexicographically first maximal subgraph problems.- Make your enemies transparent.- Optimal fault-tolerant ATM-routings for biconnected graphs.