Abstract is missing.
- The Post-Office Problem and Related QuestionsHermann A. Maurer. 1-19
- Series of Graphs Generated by Rational MachinesHidenosuke Nishio. 20-31
- On Linearizing GraphsKurt-Ulrich Witt. 32-41
- Set-Theoretic Concepts in Programming Languages and their ImplementationHans Jürgen Schneider. 42-54
- Graph Rewriting and Automatic, Machine-Independent Program OptimizationManfred Nagl. 55-69
- Properties of Ordered Graph GrammarsHelmut J. Ludwigs. 70-79
- The Power of a One-Dimensional Vector of ProcessorsJon Louis Bentley, Thomas Ottmann. 80-89
- A New Data Structure for Representing Sorted ListsKurt Mehlhorn. 90-112
- On the Use of Some Almost Sure Graph PropertiesGottfried Tinhofer. 113-126
- On a Generalization of HeapsHartmut Noltemeier. 127-136
- Graph Grammars and the Complexity Gap in the Isomorphism Problem for Acyclic DigraphsManfred Schnitzler. 137-149
- Issues in the Study of Graph EmbeddingsArnold L. Rosenberg. 150-176
- Schema Hypergraphs: A Formalism to Investigate Logical Data Base DesignCarlo Batini, Alessandro D Atri. 177-194
- The Use of Transitively Irreducible Kernels of Full Families of Functional Dependencies in Logical Data Base DesignPeter Kandzia, Margret Mangelmann. 195-211
- Graph Algorithms for the Synthesis and Manipulation of Data Base SchemesGiorgio Ausiello, Alessandro D Atri. 212-233
- The Analysis of Search Trees: A SurveyThomas Ottmann, Hans-Werner Six, Derick Wood. 234-249
- A Framework for Data StructuresHans-Werner Six. 250-267
- Investigating Programs in Terms of Partial GraphsGunther Schmidt. 268-269
- An Observation Concerning the Complexity of Problems with Few Solutions and its Application to CryptographyShimon Even, Yacov Yacobi. 270-278
- Bounding the Bandwidth of NP-Complete ProblemsBurkhard Monien. 279-292
- The Complexity of Path Problems in Graphs and Path Systems of Bounded BandwidthIvan Hal Sudborough. 293-305
- A Comparison Between Petri-Nets and Graph GrammarsHans-Jörg Kreowski. 306-317
- A Graph Grammar Representation of Non-Sequential ProcessesWolfgang Reisig. 318-325
- Reachablity Homomorphisms on NetsJürgen Ebert, Jürgen Perl. 326-334
- A Birds Eye View to Path ProblemsBernd Mahr. 335-353
- The Chinese Postman Problem for Mixed GraphsPeter Brucker. 354-366
- Alternative Cycle Covers and PathsOliver Vornberger. 367-378
- Generating All Planar 0-, 1-, 2-, 3-Connected GraphsPeter Läuchli. 379-382
- Optimal (s, t)-Cuts (Extended Abstract)Horst W. Hamacher. 383-387
- F-Factors, Perfect Matchings and Related ConceptsUlrich Derigs. 388-403