|
|
|||
|
||||
OverviewGraph-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 Full Product DetailsAuthor: Gottfried Tinhofer , Gunther SchmidtPublisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K Edition: 1987 ed. Volume: 246 Dimensions: Width: 15.50cm , Height: 1.70cm , Length: 23.30cm Weight: 0.493kg ISBN: 9783540172185ISBN 10: 3540172181 Pages: 314 Publication Date: 08 April 1987 Audience: College/higher education , Professional and scholarly , Undergraduate , Postgraduate, Research & Scholarly Format: Paperback Publisher's Status: Active Availability: Out of stock ![]() The supplier is temporarily out of stock of this item. It will be ordered for you on backorder and shipped when it becomes available. Table of ContentsReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |