Graph-Theoretic Concepts in Computer Science: 23rd International Workshop, WG'97, Berlin, Germany, June 18-20, 1997. Proceedings, Volume 23
Rolf H. Möhring
Springer Science & Business Media, Oct 29, 1997 - Computers - 376 pages
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.
What people are saying - Write a review
We haven't found any reviews in the usual places.
acyclic adjacent arbitrary arcs assume asteroidal set bandwidth requirements bicliques biconnected bipartite graphs blocks call with bandwidth Cayley graphs cdm-graph chordal graphs clause clique color complete bipartite complexity component of G Computer Science connected components connected graph consider constraints construction contains corresponding covering projection cycle defined degree denote dipaths directed Given a graph graph G h-module Hence hierarchy independent set induced subgraph intersection graph isomorphic Krausz dimension label least Lemma Let G line digraphs linear literal edges loop MAX 2-CCSP maximal maximum maximum independent set minimum fill-in multigraph neighbors node non-oblivious NP-complete number of edges obtained optimal orientation p-connected pair partition path path-consistent planar graphs polynomial problem Proof reduction routing schedule separable-homogeneous series-parallel graphs steps subgraph derivation subset t-spanner technique Theorem tree decomposition tree representation treewidth triangle-free graphs triangulation truth assignment undirected graph variable vertex vertex set weak-order extensions