Graph-Theoretic Concepts in Computer Science

Beschreibung

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

Autor*in

Gottfried Tinhofer

Themen in »Graph-Theoretic Concepts in Computer Science«

Algorithms Graph Node Sim algorithm complexity data model distributed systems petri net sets combinatorics

Stimmen zu »Graph-Theoretic Concepts in Computer Science«

Details

Link teilen