Graph-Theoretic Concepts in Computer Science : 15th International Workshop WG '89 Castle Rolduc, the Netherlands, June 14-16, 1989 Proceedings /

Graph-Theoretic Concepts in Computer Science : 15th International Workshop WG '89 Castle Rolduc, the Netherlands, June 14-16, 1989 Proceedings /

Saved in:
Bibliographic Details
Imprint:Berlin, Heidelberg : Springer-Verlag, 1990.
Description:1 online resource : v.: digital.
Language:English
Series:Lecture Notes in Computer Science, 0302-9743 ; 411
Lecture notes in computer science ; 411.
Subject:
Mathematics.
Logic design.
Data structures (Computer science)
Computer science.
Computer software.
Combinatorial analysis.
Electronics.
Combinatorial analysis.
Computer science.
Computer software.
Data structures (Computer science)
Electronics.
Logic design.
Mathematics.
Format: E-Resource Book
URL for this record:http://pi.lib.uchicago.edu/1001/cat/bib/11078179
Hidden Bibliographic Details
Other authors / contributors:Nagl, Manfred.
ISBN:9783540469506
3540469508
0387522921
9780387522920
3540522921
9783540522928
9783540522928
3540469508
Digital file characteristics:text file PDF
Notes:Includes bibliographical references and author index.
English.
Summary:The aim of this workshop series is to contribute to integration in computer science by applying graph-theoretic concepts. Commonalities between various fields of specialization in computer science may be detected by applying graph-theoretic concepts. The workshops are unusual in that they combine theoretical aspects with practice and applications. Applications dealt with in this volume include the use of graph-theoretic concepts in distributed and parallel computation, VLSI, CAD, software engineering, computer graphics, data structures, and computational geometry.
Other form:International Workshop WG (15th : 1989 : Kerkrade, Netherlands). Graph-theoretic concepts in computer science. Berlin ; New York : Springer-Verlag, ©1990 0387522921
Standard no.:10.1007/3-540-52292-1
Table of Contents:
  • Disjoint paths in the hypercube
  • Time bounds for broadcasting in bounded degree graphs
  • t/s-Diagnosable systems: A characterization and diagnosis algorithm
  • Toward a complete representation of graphoids in graphs - Abridged Version
  • CADULA - A graph-based model for monitoring CAD-processes
  • On hyperedge replacement and BNLC graph grammars
  • Graph rewriting systems with priorities
  • Filtering hyperedge-replacement languages through compatible properties
  • Describing distributed systems by categorical graph grammars
  • A parser for context free plex grammars
  • to PROGRESS, an attribute graph grammar based specification language
  • On the complexity of optimal drawings of graphs
  • Bounds to the page number of partially ordered sets
  • Beyond Steiner's problem: A VLSI oriented generalization
  • A fast sequential and parallel algorithm for the computation of the k-closure of a graph
  • On feedback problems in digraphs
  • Improved self-reduction algorithms for graphs with bounded treewidth
  • Finding a minimal transitive reduction in a strongly connected digraph within linear time
  • Paging binary trees with external balancing
  • The complexity of graph problems for succinctly represented graphs
  • An O(n log n) algorithm for 1-D tile compaction
  • Weighted parallel triangulation of simple polygons
  • Implementing data structures on a hypercube multiprocessor, and applications in parallel computational geometry
  • k - Nearest - Neighbor Voronoi diagrams for sets of convex polygons, line segments and points
  • Finding squares and rectangles in sets of points
  • Combinatorial properties of abstract Voronoi diagrams.

Similar Items