Graph-Theoretic Concepts in Computer Science : International Workshop WG '86 Bernried, Federal Republic of Germany, June 17-19, 1986, Proceedings

Gunther Schmidt

ISBN 10: 3540172181 / ISBN 13: 9783540172185

Verlag: Springer Berlin Heidelberg, 1987

Beschreibung

Druck auf Anfrage Neuware - Printed after ordering - Graph-theoretic concepts are developed by computer scientists in order to model algorithms, nets, rewriting systems, distributed systems, parallelism, geometric and layout concepts. Their complexity is studied under various randomness assumptions. This volume contains contributions to the twelfth of a series of annual workshops designed to bring together researchers using graph-theoretic methods. Its purpose is to broadcast emerging new developments from and to a diversity of application fields. The topics covered include: 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, Specific Algorithms. Bestandsnummer des Verkäufers 9783540172185

Bibliografische Details

Titel: Graph-Theoretic Concepts in Computer Science...

Verlag: Springer Berlin Heidelberg

Erscheinungsdatum: 1987

Einband: Taschenbuch

Zustand: Neu

Über diesen Titel

Reseña del editor:

Graph-theoretic concepts are developed by computer scientists in order to model algorithms, nets, rewriting systems, distributed systems, parallelism, geometric and layout concepts. Their complexity is studied under various randomness assumptions. This volume contains contributions to the twelfth of a series of annual workshops designed to bring together researchers using graph-theoretic methods. Its purpose is to broadcast emerging new developments from and to a diversity of application fields. The topics covered include: 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, Specific Algorithms. N