ISBN-10:
3540507280
ISBN-13:
9783540507284
Pub. Date:
02/21/1989
Publisher:
Springer Berlin Heidelberg
Graph-Theoretic Concepts in Computer Science: International Workshop WG `88 Amsterdam, The Netherlands, June 15-17, 1988. Proceedings / Edition 1

Graph-Theoretic Concepts in Computer Science: International Workshop WG `88 Amsterdam, The Netherlands, June 15-17, 1988. Proceedings / Edition 1

by Jan van Leeuwen

Paperback

Current price is , Original price is $129.0. You
Select a Purchase Option (1989)
  • purchase options
    $110.52 $129.00 Save 14% Current price is $110.52, Original price is $129. You Save 14%.
  • purchase options

Product Details

ISBN-13: 9783540507284
Publisher: Springer Berlin Heidelberg
Publication date: 02/21/1989
Series: Lecture Notes in Computer Science , #344
Edition description: 1989
Pages: 462
Product dimensions: 6.10(w) x 9.25(h) x 0.24(d)

Table of Contents

NC-algorithms for graphs with small treewidth.- Graph-theoretic properties compatible with graph derivations.- The monadic second-order logic of graphs : Definable sets of finite graphs.- On systems of equations defining infinite graphs.- Fault tolerant networks of specified diameter.- DFS tree construction: Algorithms and characterizations.- Serializable graphs.- Transitive closure algorithms for very large databases.- A graph-based decomposition approach for recursive query processing.- Construction of deterministic transition graphs from dynamic integrity constraints.- (Time × space)-efficient implementations of hlerarchical conceptual models.- Dominance in the presence of obstacles.- Separating a polyhedron by one translation from a set of obstacles.- Linear time algorithms for testing approximate congruence in the plane.- Moving regular k-gons in contact.- Epsilon-nets for halfplanes.- Greedy triangulation can be efficiently implemented in the average case.- A simple systolic method to find all bridges of an undirected graph.- Colouring perfect planar graphs in parallel.- An efficient parallel algorithm for the all pairs shortest path problem.- A parallel algorithm for channel routing.- Application of graph theory to topology generation for logic gates.- On the estimate of the size of a directed graph.- The average size of ordered binary subgraphs.- O(n2) algorithms for graph planarization.- Bandwidth and profile minimization.- On the spanning trees of weighted graphs.- On paths in search or decision trees which require almost worst-case time.- A time-optimal parallel algorithm for the computing of Voronoi-diagrams.- Voronoi diagrams in the moscow metric.- A sweep algorithm and its implementation: The all-nearest-neighbors problem revisited.

Customer Reviews

Most Helpful Customer Reviews

See All Customer Reviews