Graph-Theoretic Concepts in Computer Science: 17th International Workshop WG '91, Fischbachau, Germany, June 17-19, 1991. Proceedings by Gunther SchmidtGraph-Theoretic Concepts in Computer Science: 17th International Workshop WG '91, Fischbachau, Germany, June 17-19, 1991. Proceedings by Gunther Schmidt

Graph-Theoretic Concepts in Computer Science: 17th International Workshop WG '91, Fischbachau…

EditorGunther Schmidt, Rudolf Berghammer

Paperback | January 29, 1992

Pricing and Purchase Info

$117.07 online 
$128.95 list price save 9%
Earn 585 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

This volume contains contributions to the 17th Internationalworkshop on Graph-Theoretic Concepts in Computer Science(WG '91) held in Southern Bavaria in June 1991. These annualworkshops are designed to bring together researchers usinggraph-theoretic methods to discuss new developments relatingto or emerging from a diversity of application fields.The topics covered in this volume include: tree-relatedproblems, graph grammarsand rewriting, complexity,computational geometry, parallel algorithms, vertexorderings, path-oriented algorithms, applications to VLSI,and disjoint cycle problems.
Title:Graph-Theoretic Concepts in Computer Science: 17th International Workshop WG '91, Fischbachau…Format:PaperbackDimensions:264 pagesPublished:January 29, 1992Publisher:Springer Berlin HeidelbergLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540551212

ISBN - 13:9783540551218

Look for similar items by category:

Reviews

Table of Contents

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.