Graph-Theoretic Concepts in Computer Science: 23rd International Workshop, WG'97, Berlin, Germany, June 18-20, 1997. ProceedingsRolf H. Möhring Springer Science & Business Media, 29. okt. 1997 - 376 sider 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. |
Innhold
I | 1 |
V | 2 |
VI | 15 |
VII | 25 |
VIII | 38 |
IX | 52 |
X | 65 |
XI | 78 |
XXI | 199 |
XXII | 214 |
XXIII | 229 |
XXIV | 242 |
XXV | 258 |
XXVI | 273 |
XXVII | 288 |
XXVIII | 303 |
XII | 85 |
XIII | 100 |
XIV | 109 |
XV | 118 |
XVI | 132 |
XVII | 144 |
XVIII | 157 |
XIX | 171 |
XX | 184 |
XXIX | 318 |
XXXI | 333 |
XXXII | 342 |
XXXIII | 354 |
XXXIV | 369 |
| 373 | |
XXXVI | 375 |
Vanlige uttrykk og setninger
acyclic adjacent algorithm arbitrary arcs asteroidal set bandwidth requirements bicliques biconnected graph bipartite graphs blocks C₁ call with bandwidth cdm-graph chordal graphs clause clique color complexity Computer Science connected components consider constraints construction contains covering projection cycle defined degree denote digraphs dipaths e₁ Given a graph graph G graph grammar h-module H₁ Hence HHD-free hierarchy independent set induced subgraph intersection graph isomorphic Krausz dimension label layout least Lemma Let G line digraphs linear loop MAX 2-CCSP maximal maximum maximum independent sets minimum fill-in multigraph neighbors node non-oblivious NP-complete NP-hard number of edges obtained optimal orientation p-connected pair partition path path-consistent planar graphs polynomial problem Proof pseudo-h-hamiltonian reduction routing schedule series-parallel graphs subgraph derivation subset Theorem tree decomposition tree representation treewidth triangle-free graphs triangulation truth assignment u₁ undirected graph V₁ variable vertex vertex set vertices weak-order extensions