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,…mehr
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.Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
Dr. Gunther Schmidt gilt international als einer der maßgeblichen Pioniere in der Entwicklung einer Integration systemischer (auch familientherapeutischer) Modelle und der kompetenzfokussierenden Konzepte Erickson'scher Hypnotherapie zu einem ganzheitlich-lösungsfokussierenden Konzept für Beratung und Psychotherapie. Im deutschsprachigen Raum begründete er mit seinen, durch Milton Erickson angeregten Beiträgen die 'lösungsorientierte Wende' in der systemischen Familientherapie ebenso wie den Aufbau kompetenz- und lösungsorientierter Kurzzeittherapie im Bereich z.B. von Suchtproblemen, Psychosomatik und der Therapie von massiv traumatisierten Menschen. Die von ihm entwickelten systemisch- hypnotherapeutischen Modelle für Organisationsberatung, Team- und Gruppenarbeit und Coaching tragen wesentlich zu einem intensivierten ressourcenorientierten Beratungsverständnis bei. 2011 wurde Schmidt für sein Lebenswerk mit dem Life Achivement Award ausgezeichnet.
Inhaltsangabe
A simple linear-time algorithm to recognize interval graphs.- On approximation algorithms for Steiner's problem in graphs.- Specification of error distances for graphs by precedence graph grammars and fast recognition of similarity.- ADA concurrency specified by graph grammars.- Cabri, an interactive system for graph manipulation.- An interactive graphical manipulation system for higher objects based on relational algebra.- Behaviour preserving refinements of Petri nets.- The bandwidth of planar distributive lattices.- The node visit cost of brother trees.- Searching connected components in very large grid graphs.- A simple implementation of Warshall's algorithm on a vlsi chip.- On some generalizations of outerplanar graphs: Results and open problems.- Recognizing outerplanar graphs in linear time.- Graphs and graph polynomials of interest in chemistry.- Applications of parallel scheduling to perfect graphs.- A graph-theoretic approach for designing fair distributed resource schedulingalgorithms.- Improved diameter bounds for altered graphs.- Separability of sets of polygons.- Centipede graphs and visibility on a cylinder.- The diameter of connected components of random graphs.- An algorithm for testing planarity of hierarchical graphs.- EDM - A data model for electronic CAD/CAM-applications.
A simple linear-time algorithm to recognize interval graphs.- On approximation algorithms for Steiner's problem in graphs.- Specification of error distances for graphs by precedence graph grammars and fast recognition of similarity.- ADA concurrency specified by graph grammars.- Cabri, an interactive system for graph manipulation.- An interactive graphical manipulation system for higher objects based on relational algebra.- Behaviour preserving refinements of Petri nets.- The bandwidth of planar distributive lattices.- The node visit cost of brother trees.- Searching connected components in very large grid graphs.- A simple implementation of Warshall's algorithm on a vlsi chip.- On some generalizations of outerplanar graphs: Results and open problems.- Recognizing outerplanar graphs in linear time.- Graphs and graph polynomials of interest in chemistry.- Applications of parallel scheduling to perfect graphs.- A graph-theoretic approach for designing fair distributed resource schedulingalgorithms.- Improved diameter bounds for altered graphs.- Separability of sets of polygons.- Centipede graphs and visibility on a cylinder.- The diameter of connected components of random graphs.- An algorithm for testing planarity of hierarchical graphs.- EDM - A data model for electronic CAD/CAM-applications.
Es gelten unsere Allgemeinen Geschäftsbedingungen: www.buecher.de/agb
Impressum
www.buecher.de ist ein Internetauftritt der buecher.de internetstores GmbH
Geschäftsführung: Monica Sawhney | Roland Kölbl | Günter Hilger
Sitz der Gesellschaft: Batheyer Straße 115 - 117, 58099 Hagen
Postanschrift: Bürgermeister-Wegele-Str. 12, 86167 Augsburg
Amtsgericht Hagen HRB 13257
Steuernummer: 321/5800/1497
USt-IdNr: DE450055826