Graph-theoretic concepts in computer science : 17th International Workshop, WG '91, Fischbachau, Germany, June 17-19, 1991 : proceedings
著者
書誌事項
Graph-theoretic concepts in computer science : 17th International Workshop, WG '91, Fischbachau, Germany, June 17-19, 1991 : proceedings
（Lecture notes in computer science, 570）
Springer-Verlag, c1992
- : gw
- : us
- タイトル別名
-
WG '91 : Graph-theoretic concepts in computer science
大学図書館所蔵 件 / 全64件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
内容説明・目次
内容説明
This volume contains contributions to the 17th International
workshop on Graph-Theoretic Concepts in Computer Science
(WG '91)
held in Southern Bavaria in June 1991. These annual
workshops are designed to bring together researchers using
graph-theoretic methods to discuss new developments relating
to or emerging from a diversity of application fields.
The topics covered in this volume include: tree-related
problems, graph grammarsand rewriting, complexity,
computational geometry, parallel algorithms, vertex
orderings, path-oriented algorithms, applications to VLSI,
and disjoint cycle problems.
目次
Approximating treewidth, pathwidth, and minimum elimination tree height.- Monadic second-order evaluations on tree-decomposable graphs.- Optimal embedding of complete binary trees into lines and grids.- Graph rewriting systems and their application to network reliability analysis.- Nondeterministic control structures for graph rewriting systems.- A language for generic graph-transformations.- Attributed elementary programmed graph grammars.- The complexity of approximating the class Steiner tree problem.- On complexity of some chain and antichain partition problems.- Tight bounds for the rectangular art gallery problem.- Voronoi diagrams of moving points in the plane.- Using maximal independent sets to solve problems in parallel.- Fast parallel algorithms for coloring random graphs.- Optimal vertex ordering of a graph and its application to symmetry detection.- Edge separators for graphs of bounded genus with applications.- Line digraph iterations and the spread concept-with application to graph theory, fault tolerance, and routing.- A generalized encryption scheme based on random graphs.- Dynamic algorithms for shortest paths in planar graphs.- Complete problems for logspace involving lexicographic first paths in graphs.- A new upper bound on the complexity of the all pairs shortest path problem.- On the crossing number of the hypercube and the cube connected cycles.- Logic arrays for interval indicator functions.- On the broadcast time of the butterfly network.- On disjoint cycles.- Short disjoint cycles in cubic bridgeless graphs.
「Nielsen BookData」 より