Del 570 - Lecture Notes in Computer Science

Graph-Theoretic Concepts in Computer Science

17th International Workshop WG '91, Fischbachau, Germany, June 17-19, 1991. Proceedings

Häftad, Engelska, 1992

Av Gunther Schmidt, Rudolf Berghammer

709 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum1992-01-29
Mått155 x 233 x 15 mm
Vikt411 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor256
Upplaga1992
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540551218

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it
Diskret matematik inom Naturvetenskap och teknik
Programmeringsböcker inom Data och it
Databaser inom Data och it

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.