Overview

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.

Full Product Details

Author:   Gunther Schmidt ,  Rudolf Berghammer
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint:   Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Edition:   1992 ed.
Volume:   570
Dimensions:   Width: 15.50cm , Height: 1.40cm , Length: 23.30cm
Weight:   0.850kg
ISBN:  

9783540551218

ISBN 10:   3540551212
Pages:   256
Publication Date:   29 January 1992
Audience:   College/higher education ,  Professional and scholarly ,  Postgraduate, Research & Scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   In Print  
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

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.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions