Lecture Notes in Computer Science

Transcription

1 Lecture Notes in Computer Science Edited by G. Goos and J. Hartmanis 246 I II I I Graph-Theoretic Concepts in Computer Science International Workshop WG '86 Bernried, Federal Republic of Germany, June 17-19, 1986 Proceedings Edited by Gottfried Tinhofer and Gunther Schmidt ]1 II IIU II IIII Springer-Verlag Berlin Heidelberg NewYork London Paris Tokyo

2 Editorial Board D. Barstow W. Brauer P. Brinch Hansen D. Gries D. Luckham C. Moler A. Pnueti G. SeegmLilter J. Stoer N. Wirth Editors Gottfried Tinhofer, Institut fl~r Mathematik Gunther Schmidt, Institut flit Informatik Technische Universit~t M~Jnchen Postfach D-8000 M(Jnchen 2, Federal Republic of Germany CR Subject Classification (1987): B.7.2, C.2.1, D.4.1, E.1, F.1.3, F.2, F.4.2, G.1.6, G.2.2, J.2 ISBN Springer-Verlag Berlin Heidelberg New York ISBN Springer-Verlag New York Berlin Heidelberg This work is subje~ to copyright. All rights are reserved, whether the whole or part of the matedal is concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in other ways, and storage in data banks. Duplication of this publication or parts thereof is only permitted under the provisions of the German Copyright Law of September 9, 1965, in its version of June 24, 1985, and a copyright fee must always be paid. Violations fall under the prosecution act of the German Copyright Law. Springer-Verlag Berlin Heidelberg 1987 Printed in Germany Printing and binding: Druckhaus Beltz, Hemsbach/Bergstr. 2145/

3 Preface This volume is based on the contributions to the 12 t~ International Workshop WG "86 on Graph- Theoretic Concepts in Computer Science, which took place from June 17th to 19th, 1986 at the monastery Bemried situated south-west of the Lake of Starnberg near Munich. The workshop was attended by some 60 invited scientists from 11 countries (Austria, France, Germany, Greece, India, Italy, Poland, Sweden, The Netherlands, United States, Yugoslavia). The scientific programme consisted of selected papers arranged in sessions headlined Specific Algorithms, Graph Grammars, Graph Manipulation, Nets, Complexity Issues, Algorithmic and Network Considerations, Outerplanar Graphs, Graph Isomorphism, Parallelism and Distributed Systems, Graphs and Geometry, Randomness Considerations, Applications in Chemistry. This votume contains representative papers which underwent revision based on the comments received from the workshop. WG "86 was the 12th workshop of an annual series of workshops that took place at and have been organized by Berlin 1975 U. Pape G6ttingen Linz 1976 H. Noltemeier 1977 J. Mtihlbacher Castle Feuerstein near Erlangen 1978 M. Nagl, H.J. Schneider Berlin 1979 U. Pape Bad Honnef 1980 H. Noltemeier Linz 1981 J. Mtihlbacher Neunkirchen am Brand 1982 H.J. Schneider, H. G~Sttler Osnabriick 1983 M. Nagl, J. Perl Berlin 1984 U..Pape Castle Schwanberg near Wtirzburg 1985 H. Noltemeier It has been a characteristic of this series of workshops that a limited number of participants are invited to present and discuss their actual research problems in a familiar atmosphere. The workshop WG "86 has been supported by Stiftung Volkswagenwerk (Hannover) and by SIEMENS AG (Munich). This financial support is gratefully acknowledged. Thanks are due to R. Berghammer, H. Schreck, T. Str6hlein and H. Zierer, who helped in organizing the workshop. Finally we want to express our gratitude and appreciation to the sisters of the monastery Bemried for their hospitality. Munich, January 1987 Gottfried Tinhofer and Gunther Schmidt

4

5 Table of Contents Specific Algorithms N. Korte, R. H. M6hring (Bonn) A Simple Linear-Time Algorithm to Recognize Interval Graphs P. Widmayer (Kartsruhe) On Approximation Algorithms for Steiner's Problem in Graphs 17 Graph Grammars M. Kaul (Passau) Specification of Error Distances for Graphs by Precedence Graph Grammars and Fast Recognition of Similarity M. Jackel (Koblenz) ADA Concurrency Specified by Graph Grammars Graph Manipulation M. Dao, M. Habib, J. P. Richard, D. Tallot (Brest) CABRI, An Interactive System for Graph Manipulation H. Zierer, G. Schmidt, R. Berghammer (Munich) An Interactive Graphical Manipulation System for Higher Objects Based on Relational Algebra Nets W. Vogler (Munich) Behaviour Preserving Refinements of Petri Nets 82 Complexity Issues U. Faigle, G. Gierz (Bonn, Riverside) The Bandwidth of Planar Distributive Lattices R. Klein, D. Wood (Karlsruhe, Waterloo) The Node Visit Cost of Brother Trees

6 Vt Algorithmic and Network Considerations St. Abramowski, H. MUller (Karlsruhe) Searching Connected Components in Very Large Grid Graphs Ramesh Dewangan, C. Pandu Rangan (Madras) A Simple Implementation of Warshall's Algorithm on a VLSI Chip Outerplanar Graphs and Graph Isomorphism M. M. Syslo (Wroclaw) On Some Generalizations of Outerplanar Graphs: Results and Open Problems M. Wiegers (Paderborn) Recognizing Outerplanar Graphs in Linear Time Applications in Chemistry I. Gutman (Kragujevac) Graphs and Graph Polynomials of Interest in Chemistry Parallelism and Distributed Systems D. Helmbold, E. Mayr (Stanford) Applications of Parallel Scheduling to Perfect Graphs H. F. Wedde (Detroit) A Graph-Theoretic Approach for Designing Fair Distributed Resource Scheduling Algorithms t Graphs and Geometry A. Schoone, H. Bodlaender, J. van Leeuwen (Utrecht) Improved Diameter Bounds for Altered Graphs F. Dehne, J.-R. Sack (Ottawa) Separability of Sets of Polygons R. Tamassia, I. G. Tollis (Urbana) Centipede Graphs and Visibility on a Cylinder

7 vii Randomness Considerations P. Spirakis (New York, Patras) The Diameter of Connected Components of Random Graphs 264 Specific Problems G. Di Battista, E. Nardelli (Rome) An Algorithm for Testing Planarity of Hierarchical Graphs D. Ruland (Wi~zburg, San Jos6) EDM - A Data Model for Electronic CAD/CAM-Applications Index of Authors 307