Graphtheoretic Concepts in Computer Science: Proceedings of the International Workshop WG 80 Bad Honnef, June 15–18, 1980

The post-office problem and related questions....Pages 1-19
Series of graphs generated by rational machines....Pages 20-31
On linearizing graphs....Pages 32-41
Set-theoretic concepts in programming languages and their implementation....Pages 42-54
Graph rewriting and automatic, machine-independent program optimization....Pages 55-69
Properties of ordered graph grammars....Pages 70-79
The power of a one-dimensional vector of processors....Pages 80-89
A new data structure for representing sorted lists....Pages 90-112
On the use of some almost sure graph properties....Pages 113-126
On a generalization of heaps....Pages 127-136
Graph grammars and the complexity gap in the isomorphism problem for acyclic digraphs....Pages 137-149
Issues in the study of graph embeddings....Pages 150-176
Schema hypergraphs:A formalism to investigate logical data base design....Pages 177-194
The use of transitively irreducible kernels of full families of functional dependencies in logical data base design....Pages 195-211
Graph algorithms for the synthesis and manipulation of data base schemes....Pages 212-233
The analysis of search trees: A survey....Pages 234-249
A framework for data structures....Pages 250-267
Investigating programs in terms of partial graphs....Pages 268-269
An observation concerning the complexity of problems with few solutions and its application to cryptography....Pages 270-278
Bounding the bandwidth of NP-complete problems....Pages 279-292
The complexity of path problems in graphs and path systems of bounded bandwidth....Pages 293-305
A comparison between petri-nets and graph grammars....Pages 306-317
A graph grammar representation of nonsequential processes....Pages 318-325
Reachability homomorphisms on nets....Pages 326-334
A birds eye view to path problems....Pages 335-353
The chinese postman problem for mixed graphs....Pages 354-366
Alternating cycle covers and paths....Pages 367-378
Generating all planar 0-,1-,2-,3-connected graphs....Pages 379-382
Optimal (s,t)-cuts....Pages 383-387
F-factors, perfect matchings and related concepts....Pages 388-403