Graph-Theoretic Concepts in Computer Science: International Workshop WG '86 Bernried, Federal Republic of Germany, June 17-19, 1986, Proceedings

by Gottfried Tinhofer (Editor)

A simple linear-time algorithm to recognize interval graphs.- On approximation algorithms for Steiner's problem in graphs.- Specification of error distances for graphs by precedence graph grammars and fast recognition of similarity.- ADA concurrency specified by graph grammars.- Cabri, an interactive system for graph manipulation.- An interactive graphical manipulation system for higher objects based on relational algebra.- Behaviour preserving refinements of Petri nets.- The bandwidth of planar distributive lattices.- The node visit cost of brother trees.- Searching connected components in very large grid graphs.- A simple implementation of Warshall's algorithm on a vlsi chip.- On some generalizations of outerplanar Results and open problems.- Recognizing outerplanar graphs in linear time.- Graphs and graph polynomials of interest in chemistry.- Applications of parallel scheduling to perfect graphs.- A graph-theoretic approach for designing fair distributed resource scheduling algorithms.- Improved diameter bounds for altered graphs.- Separability of sets of polygons.- Centipede graphs and visibility on a cylinder.- The diameter of connected components of random graphs.- An algorithm for testing planarity of hierarchical graphs.- EDM - A data model for electronic CAD/CAM-applications.

324 pages, Paperback

First published May 18, 1987

About the author

Gottfried Tinhofer

Ph.D. Universität Innsbruck 1966 Austria
Dissertation: Untersuchungen über allgemeine Kreisscharen in der ebenen Geometrie von Lie