Lecture Notes in Computer Science

Transcription

1 Lecture Notes in Computer Science Edited by G. Goos and J. Hartmanis 484 R.H. M6hring (Ed.) Graph-Theoretic Concepts in Computer Science 16th International Workshop WG '90 Berlin, Germany, June 20-22, 1990 Proceedings I I I Springer-Verlag Berlin Heidelberg New York London Paris Tokyo Hong Kong Barcelona Budapest

2 Editorial Board D. Barstow W. Brauer P. Brinch Hansen D, Gries D. Luckham C. Moler A. Pnueli G. Seegm~Jller J. Stoer N. Wirth Volume Editor Rolf H. M6hring Fachbereich 3 Mathematik (MA 6-1) Technische Universit&t Berlin StraBe des 17. Juni 136, W-1000 Berlin 12, FRG CR Subject Classification (1991): B.6.t, B.?.t, E.1, E1.2-3, E2, E4, G.2.2, H.2.1, H.2.4 ISBN Springer-Verlag Berlin Heidelberg New York ISBN Springer-Verlag NewYork Berlin Heidelberg This work is subject to copyright. All rights are reserved, whether the whole or part of the material 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 current version, and a copyright fee must always be paid, Violations fall under the prosecution act of the German Copyright Law. Springer-Verlag Berlin Heidelberg 1991 Printed in Germany Printing and binding: Druckhaus Beltz, HemsbachtBergstr, Printed on acid-free paper

3 Preface The 16th International Workshop on Graph-Theoretic Concepts in Computer Science (WG ~90) was held at the Johannisstift Spandau in Berlin, Federal Republic of Germany, June 20-22, It was organized by the group "Discrete Mathematics and Computer Science" of the Department of Mathematics of the Technical University of Berlin. The successful tradition of the WG workshops, which take place in alternate places in Central Europe every year, is reflected by the list of predecessor workshops and their organizers: Berlin 1975 U. Pape GSttingen 1976 H. Noltemeier Linz 1977 J. Mfihlbacher Castle Feuerstein near Erlangen 1978 M. Nagl und H.J. Schneider Berlin 1979 U. Pape Bad Honnef 1980 H. Noltemeier Linz 1981 J. Mfihlbacher Neunkirchen near Erlangen 1982 H.J. Schneider und H, GSttter Haus Ohrbeck near Osnabrfick 1983 M. Nagl und J. Perl Berlin 1984 U. Pape Castle Schwanenberg near Wfirzburg 1985 H. Noltemeier Monastery Bernried near Miinchen I986 G. Tinhofer und G. Schlvidt Castle Banz near Bamberg 1987 H. G5ttter und H.J. Schneider Amsterdam I988 J. van Leeuwen Castle R, olduc near Aachen 1989 M. Nagl The program committee of WG tg0 consisted off H. Alt G. Ausiello B. Courcelle T. Lengauer J.K. Lenstra E. Mayr ILH. MShring M. Nagl H. Noltemeier G. Schmidt H.J. Schneider G. Tinhofer J. van Leeuwen E. Welzl Free University of Berlin, Germany University of t~ome "La Sapienza', Italy University of Bordeaux, France University of Paderborn, Germany Technical University of Eindhoven, The Netherlands University of Frankfurt, Germany Technical University of Berlin, Germany Aachen University of Technology, Germany University of W/irzburg, Germany University of German Forces at Munich, Germany University of Erlangen, Germany Technical University of Munich, Germany University of Utrecht, The Netherlands Free University of Berlin, Germany

4 IV In the call for papers, contributions were solicited describing original results in the study and apphcation of graph-theoretic concepts in various fields of computer science. From 81 submissions the program committee selected 28 for presentation. The selection reflects several current research directions with main emphasis on graph algorithms and complexity distributed and parallel computing computational geometry VLSI layout The present volume contains the revised versions of nearly all the papers presented at the workshop. The revisions are based on the comments and suggestions received by the authors from referees and/or participants at the workshop. Several papers are in the form of preliminary reports on ongoing research. It is expected that more elaborate versions of these papers will eventually appear in scientific journals. The members of the program committee hope that this volume gives a good impression of activities in the field of graph-theoretic concepts in computer science. The workshop was attended by 96 participants from 13 countries: Canada, Denmark, France, the United Kingdom, Greece, Israel, Italy, Poland, Switzerland, The Netherlands, the United States of America, the Federal Republic of Germany and the German Democratic Republic (which were still separate states during the workshop). The success of the workshop is due to the activeness of participants contributing to the presentations and discussions, and to the work done by referees and especially by the members of the program committee. The editor is grateful for financial support from the Department of Mathematics of the Technical University of Berlin, the Berliner Commerzbank, the Raiffeisen KSpenicker Bank, Sun Microsystems, Springer-Verlag, and in particular the Deutsche Forschungsgemeinschaft, which generously supported so many participants from East Berlin and the German Democratic Republic. The friendly atmosphere of this workshop was in great part due to the attractive workshop location in Johannisstift Spandau. We would like to thank the staff of this institution who looked after us so well. Last but certainly not least the editor would like to say thanks to the members of the organization committee consisting of Bettina Buch, Stefan Felsner, Jens Gustedt, Annegret Liebers, Rudolf M/iller, Robert Mundt, Heike Ripphausen-Lipa, Dorothea Wagner and several students of the TU Berlin. Berlin, January 1991 Roll H. MShring

5 The following persons helped as referees to select the papers for presentation: E.H.L. Aarts E. Mayr g. Alt R.H. Mghring T. Andreae B. Monien F. Aurenhammer Roll Miiller G. AusielIo Rudolf Mfiller L. Babel F. Miindemann B. Behrends M. Nagl R. Berghammer H. Noltemeier J. Bl/~mer W. Oberschetp H. Bodlaender Y. Pearl A. Brandstgdt A. Proskurowski B. Courcelle M. Protasi E. Dahlhaus R. Reischuk J. Doenhardt M.M. Richter J. Ebert C. Ripphausen-Lipa H. Ehrig G. Rote U. Faigle A. Sassano S. Felsner A. Schikarski M. Formann U. Schmerl U. Fuchs G. Schmidt M. Godan A. Schfirr R. Guibrod J. Schreiber J. Gustedt O. Schwarzkopf F. Haber J. Spinrad M. Habib M. Talamo J. Heistermann W. Thomas F. Hoefting G. Tinhofer C.A.J. Hurkens J. van Leeuwen S. Iwanowski M. yon der Beeck J.M. Janas W. Vogler H. Jung D. Wagner W. Kern F. Wagner C.A.P. Kindervater E. Wanke M. Kunde E. Welzl T. Lengauer B. Westfechtet J.K. Lenstra C. Wieners-Lummer M. LSwe B. Wolfers T. Ludwig

6 Contents Graph Algorithms and Complexity Grammati E. Pantziou, University of Patras, Greece, Paul G. Spiralds, University of Patras, Greece, and Courant Institute, USA, Christos D. Zaroliagis, University of Patras, Greece Optimal parallel algorithms for sparse graphs... 1 Jiirgen Plehn, Bernd Voigt, UniversitEt Bonn, Germany Finding minimally weighted subgraphs Hans L. Bodlaender, Utrecht University, The Netherlands On the complexity of some coloring games Ulrich Huckenbeck, Universit t Wiirzburg, Germany Dettev Ruland, Siemens AG, Miinchen, Germany A generalized best.first search method in graphs... 4i Tze-tteng Ma, Jeremy P. Spinrad, Vanderbuilt University, USA Avoiding matrix multiplication Peter Damaschke, Friedrich-Schiller-Universit t Jena, Germany Induced subgraph isomorphism for cographs is NP-complete Hermzmn Stamm~ Universitgt Bonn, Germany On feedback problems in planar digraphs Franz Aurenhammer, Freie UniversitEt Berlin, Germany Johann Hagauer, Graz University of Technology, Austria Recognizing binary Hamming graphs in O ( n~ log n ) time VLSI Layout Kuo-Feng Liao, Majid Saxrafzadeh, Northwestern University, USA Vertex-disjoint trees and boundary single-layer routing Edmund Ihler, UniversitEt ~-~eiburg, GermaI W Bounds on the quality of approximate solutions to the group Steiner problem Claudio Arbib, UniversitY, di Roma "Tor Vergata", Italy Two polynomial problems in PLA folding Michael Formann, Frazak Wagner, Freie UniversitEt Berlin, Germany The VLSI layout problem in various embedding models

7 Vltl Filiia Makedon, Spyros Tragoudas, University of Texas at Dallas, USA Approximating the minimum net expansion: Near optimal solutions to circuit partitioning problems Multiprocessor Systems and Concurrency Seshu Madhavapeddy, I. Hal Sudborough, University of Texas at DMlas, USA Deterministic message routing in faulty hypercubes Hyeong-Ah Choi, George Washington University, USA Abdol-Itossein Esfahanian, Michigan State University, USA On complexity of a message-routing strategy for multicomputer systems Peter Zienicke, tiumboldt Universit//t, Berlin, Germany Embeddings of treelike graphs into 2-dimensional meshes A. Das, K. Thulasiraman, Concordia University, Montreal, Canada Diagnosis of t/s-diagnosable systems Ofer Biran, Shlomo Moran, Shumuel Zaks, Technion, Hails, Israel Deciding 1-solvability of distributed task is NP-hard Michel ttabib, Michd Morvan, Jean-Xavier Rampon, CNRS and Uaiversitd de Montpellier, France Remarks on some concurrency measures Computational Geometry Frank Hoffmann, Akademie der Wissenschaften, Berlin, Germany Michael Kaufmann, Universit t des Saarlandes, Germany On the rectilinear art gallery problem - algorithmic aspects Paul Fischer, Universit t Dortmund, Germany Hans Ulrich Simon, Universit t des Saarlandes, Germany Separation problems and circular arc systems... 25t Klaus P~euter, Technische Hochschule Darmstadt, Germany Ivan Pdval, University of Ottawa, Canada Genus of orders and lattices Graphs, Languages and Databases Iain A. Stewart, University of Newcastle upon Tyne, Great Britain Comparing the expressibility of two languages formed using NP-complete graph operators

8 IX Dietmar Seipel, Universit t Tiibingen, Germany Decomposition of linear recursive logic programs... 29t Graph Grammars Didier Caueal, Roland Monfort, IRISA and IRMAR, Rennes-Cedex, France On the transition graphs of automata and grammars Michael LSwe, Hartmut Ehrig, Technische Universit t Berlin, Germany Algebraic approach to graph transformation based on single pushout derivatiol~s Annexes List of Partidpants Authors' Index List of WG Proceedings