Lecture Notes in Computer Science

Transcription

1 Lecture Notes in Computer Science Edited by G. Goos and J. Hartmanis 790 Advisory Board: W. Brauer D. Gries J. Stoer

2 Jan van Leeuwen (Ed.) Graph-Theoretic Concepts in Computer Science 19th International Workshop, WG '93 Utrecht, The Netherlands, June 16-18, 1993 Proceedings Springer-Verlag Berlin Heidelberg NewYork London Paris Tokyo Hong Kong Barcelona Budapest

3 Series Editors Gerhard Goos Universit~it Karlsruhe Postfach Vincenz-Priessnitz-Strage 1 D Karlsruhe, Germany Juris Hartmanis Cornell University Department of Computer Science 4130 Upson Hall Ithaca, NY 14853, USA Volume Editor Jan van Leeuwen Department of Computer Science, Utrecht University Padualaan 14, 3584 CH Utrecht, The Netherlands CR Subject Classification (1991): G.2.2, F.2, E1.2-3, E3, E4, E.I ISBN Springer-Verlag Berlin Heidelberg New York ISBN Springer-Verlag New York Berlin Heidelberg CIP data applied for 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 any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer-Verlag. Violations are liable for prosecution under the German Copyright Law. 9 Springer-Verlag Berlin Heidelberg 1994 Printed in Germany Typesetting: Camera-ready by author SPIN: / Printed on acid-free paper

4 Preface The 19th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'93) was held near Utrecht (the Netherlands), in the conference facilities of the 'Na- tional Sports Centre Papendal' of the Dutch National Sports Federation. The workshop featured sessions on structural graph theory, dynamic graph algorithms, 'hard' problems on special classes of graphs, structure-oriented graph algorithms, circuit and net theory, interconnection networks, distributed algorithms on graphs, and graph embedding and layout. The WG workshops are an annual event for all researchers interested in the study and application of graph-theoretic concepts. The successful tradition of the workshops is well documented in the series Lecture Notes in Computer Science, as evidenced by the following overview of the past five WG's: WG Year Organizer Organizing Site Proceedings M. Nagl Aachen LNCS Yol R.H. MShring Berlin LNCS Vol G. Schmidt and Miinchen LNCS Vol 570 R. Berghammer E.W. Mayr Frankfurt LNCS Vol J. van Leeuwen Utrecht this volume A complete listing of all prior WG workshops and their proceedings was included in the proceedings of WG'89 (page 374). The program committee for WG'93 consisted of: Ernst W. Mayr (Miinchen) Paul Spirakis (Patras) Roll H. MShring (Berlin) Roberto Tamassia (Providence) Manfred Nagl (Aachen) Gottfried Tinhofer (Miinchen) Hartmut Noltemeier (Wiirzburg) Jan van Leeuwen (Utrecht, chairman) Gunther Schmidt (Miinchen) Jiri Wiedermann (Prague) In response to the Call for Papers for WG'93 the program committee received 92 submissions, indicating a strong and ever growing interest for the WG workshops. In view of the very good overall quality of the submissions and after a careful refereeing process, the committee decided to accept as many as 35 papers into the scientific program of the workshop. The selection reflects many of the current directions of research in the

5 VI area of graph-based algorithms, both within graph-theory and in more applied contexts like circuits and networks. The larger number of selected papers could be accommodated by setting varying lengths for the presentations, and allowed for an optimal exchange of information on current research. The present volume contains all papers presented in the workshop. All papers have been carefully revised based on the comments and suggestions which were received by the authors during the workshop. The material thus represents an up-to-date account of the work in the various directions. We hope that the papers in this volume stimulate further research in the area of applied graph theory and its many ramifications from algorithm design to software engineering. WG'93 enjoyed a very international and stimulating participation. We are grateful to the 'National Sports Centre Papenda]' of the Dutch National Sports Federation for allowing the use of its excellent conference facilities for the workshop, to the Department of Computer Science of Utrecht University for supporting the organization of the WG'93 workshop, and to Margje Punt and Goos I~:ant for invaluable assistance in all matters related to the workshop. Utrecht, February 1994 Jan van Leeuwen

6 Co~e~s Hard Problems on Classes of Graphs Near-Optimal Dominating Sets in Dense Random Graphs... 1 in Polynomial Expected Time S.E. Nikoletseas, P.G. Spira~is Approximating Minimum Weight Perfect Matchings for Complete Graphs Satisfying the Triangle Inequality N. IV. HoUoway, S. Ravindran, A.M. Gibbons Hierarchically Specified Unit Disk Graphs M. V. Marathe, V. Radhakrishnan, H.B. Hunt III, S.S. Ravi Structural Graph Theory Bounded Treewidth and LOGCFL E. Wanke On Reduction Algorithms for Graphs with Small Treewidth H.L. Bodlaender Algorithms and Complexity of Sandwich Problems in Graphs M.C. Golumbic, H. Kaplan, R. Sham@ Dynamic Graph Algorithms On-line Graph Algorithms for Incremental Compilation A. Marchetti-Spaccamela, U. Nanni, H. Rohnert Average Case Analysis of Fully Dynamic Connectivity for Directed Graphs P. Alimonti, S. Leonardi, A. Marchetti-Spaccamela, X. Messeguer Fully Dynamic Maintenance of Vertex Cover Z. Ivkovid, E.L. Lloyd Dynamic Algorithms for Graphs with Treewidth H.L. Bodlaender Structure-Oriented Graph Algorithms Short Disjoint Cycles in Graphs with Degree Constraints A. Brandstiidt, H-J. Voss Efficient Algorithms for Tripartitioning Triconnected Graphs and 3-Edge-Connected Graphs K. Wada, K. Kawaguchi

7 Viii Towards a Solution of the Holyer's Problem Z. Lone Graphs, Hypergraphs and Hashing G. Havas, B.S. Majewski, N.C. Wormald, Z.J. Czech Graph Coloring Coloring k-colorable Graphs in Constant Expected Parallel Time L. Ku~era Deciding 3-Colorability in Less than O(1.415 ") Steps... : L Schiermeyer A Rainbow about T-Colorings for Complete Graphs K. Jansen Approximating the Chromatic Polynomial of a Graph N- W. Lin AT-Free and Chordal Graphs Asteroidal Triple-Free Graphs D.G. Corneil, S. Olariu, L. Stewart The Parallel Complexity of Elimination Ordering Procedures E. Dahlhaus Dually Chordal Graphs A. Brandstddt, F.F. Dragan, V.D. Chepoi, V.L Voloshin Circuits and Nets The Size of Reduced OBDDs and Optimal Read-Once Branching Programs for Almost All Boolean Functions L Wegener Regular Marked Petri N@ts J. Desel The Asynchronous Committee Meeting Problem J. Esparza, B. von Stengel Graphs and Interconnection Networks Gossiping in Vertex-Disjoint Paths Mode in Interconnection Networks J. Hromkovid, R. Klasing, E.A. Stdhr

8 I The Folded Petersen Network: A New Versatile Multiprocessor Interconnection Topology S.R. ()hrin9, S.K. Das Fast Load Balancing in Cayley Graphs and in Circuits J.E. Boillat Routing and Shortest Paths Concurrent Flows and Packet Routing in Cayley Graphs F. Shahrokhi, L.A. Sz@kely On Multi-Label Linear Interval Routing Schemes E. Kranakis, D. Krizanc, S.S. Ravi An 'All Pairs Shortest Paths' Distributed Algorithm Using 2n 2 Messages S. Haldar Graph Embedding and Layout Linear Layouts of Generalized Hypercubes K. Nakano Graph Ear Decompositions and Graph Embeddings J. Chen, S.P. Kanchi Improved Bounds for the Crossing Numbers on Surfaces of Genus g F. Shahrokhi, L.A. Szdkely, O. S#kora, L Vrt'o Two Algorithms for Finding Rectangular Duals of Planar Graphs G. Kant, X. He A More Compact Visibility Representation G. Kant List of Participants Authors Index