Graph-Theoretic Concepts in Computer Science: 15th International Workshop WG '89, Castle Rolduc, The Netherlands, June 14-16, 1989, Proceedings, Volum 15Manfred Nagl Springer Science & Business Media, 7. mars 1990 - 372 sider The aim of this workshop series is to contribute to integration in computer science by applying graph-theoretic concepts. Commonalities between various fields of specialization in computer science may be detected by applying graph-theoretic concepts. The workshops are unusual in that they combine theoretical aspects with practice and applications. Applications dealt with in this volume include the use of graph-theoretic concepts in distributed and parallel computation, VLSI, CAD, software engineering, computer graphics, data structures, and computational geometry. |
Innhold
I | 3 |
II | 19 |
III | 34 |
VI | 46 |
VII | 63 |
VIII | 78 |
IX | 94 |
X | 107 |
XVII | 211 |
XVIII | 218 |
XIX | 232 |
XX | 245 |
XXI | 260 |
XXII | 277 |
XXIII | 287 |
XXIV | 302 |
Andre utgaver - Vis alle
Vanlige uttrykk og setninger
algorithm applied binary trees bipartite graph bisector BNLC grammars broadcast bucket CAD-network complexity component Computer Science configuration Constraint Network construction contains coordinate corresponding curves data structures defined Definition delete denote depth-first search derivation digraph directed graphs disjoint paths edge labels embedding Figure finite function G₁ given grammar G graph G graph grammars graph rewriting graphoid Hence HR grammar hypercube hyperedge hyperedge-replacement grammars hypergraph hyperrectangle Informatik integer L(HRG Left[i Lemma Let G linear minimal node nonterminal NP-complete NP-hard O(log O(n² obtained optimal P₁ P₂ pair parser partition PE(i placement planar plex grammars plex structure points polygons polynomial poset PPbin tree problem Proc processors production Proof properties query rectangle reducible represented segment sequence Steiner step subgraph subset subtree t₁ terminal Theorem transitive reduction tree-decomposition treewidth triangulation triplets v₁ vertex labels vertex set vertices Voronoi diagrams