Mayr20th International Workshop. WG '94, Herrsching, Germany, June 16 - 18, 1994. Proceedings
Graph-Theoretic Concepts in Computer Science
20th International Workshop. WG '94, Herrsching, Germany, June 16 - 18, 1994. Proceedings
Mitarbeit:Mayr, Ernst W.; Schmidt, Gunther; Tinhofer, Gottfried
Mayr20th International Workshop. WG '94, Herrsching, Germany, June 16 - 18, 1994. Proceedings
Graph-Theoretic Concepts in Computer Science
20th International Workshop. WG '94, Herrsching, Germany, June 16 - 18, 1994. Proceedings
Mitarbeit:Mayr, Ernst W.; Schmidt, Gunther; Tinhofer, Gottfried
- Broschiertes Buch
- Merkliste
- Auf die Merkliste
- Bewerten Bewerten
- Teilen
- Produkt teilen
- Produkterinnerung
- Produkterinnerung
This volume presents the proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '94), held in Herrsching, Germany in June 1994. The volume contains 32 thoroughly revised papers selected from 66 submissions and provides an up-to-date snapshot of the research performed in the field. The topics addressed are graph grammars, treewidth, special graph classes, algorithms on graphs, broadcasting and architecture, planar graphs and related problems, and special graph problems.
Andere Kunden interessierten sich auch für
- LeeuwenGraph-Theoretic Concepts in Computer Science42,99 €
- Ernst W. Mayr (ed.)Graph-Theoretic Concepts in Computer Science42,99 €
- D'AmoreGraph-Theoretic Concepts in Computer Science42,99 €
- Graph-Theoretic Concepts in Computer Science42,99 €
- Peter Widmayer / Gabriele Neyer / Stephan Eidenbenz (eds.)Graph-Theoretic Concepts in Computer Science42,99 €
- Juraj Hromkovic / Manfred Nagl / Bernhard Westfechtel (eds.)Graph-Theoretic Concepts in Computer Science42,99 €
- Jan van Leeuwen (ed.)Graph-Theoretic Concepts in Computer Science42,99 €
-
-
-
This volume presents the proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '94), held in Herrsching, Germany in June 1994.
The volume contains 32 thoroughly revised papers selected from 66 submissions and provides an up-to-date snapshot of the research performed in the field. The topics addressed are graph grammars, treewidth, special graph classes, algorithms on graphs, broadcasting and architecture, planar graphs and related problems, and special graph problems.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
The volume contains 32 thoroughly revised papers selected from 66 submissions and provides an up-to-date snapshot of the research performed in the field. The topics addressed are graph grammars, treewidth, special graph classes, algorithms on graphs, broadcasting and architecture, planar graphs and related problems, and special graph problems.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
Produktdetails
- Produktdetails
- Lecture Notes in Computer Science 903
- Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
- Artikelnr. des Verlages: 978-3-540-59071-2
- 1994.
- Seitenzahl: 436
- Erscheinungstermin: 17. März 1995
- Englisch
- Abmessung: 235mm x 155mm x 24mm
- Gewicht: 572g
- ISBN-13: 9783540590712
- ISBN-10: 3540590714
- Artikelnr.: 09255553
- Herstellerkennzeichnung Die Herstellerinformationen sind derzeit nicht verfügbar.
- Lecture Notes in Computer Science 903
- Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
- Artikelnr. des Verlages: 978-3-540-59071-2
- 1994.
- Seitenzahl: 436
- Erscheinungstermin: 17. März 1995
- Englisch
- Abmessung: 235mm x 155mm x 24mm
- Gewicht: 572g
- ISBN-13: 9783540590712
- ISBN-10: 3540590714
- Artikelnr.: 09255553
- Herstellerkennzeichnung Die Herstellerinformationen sind derzeit nicht verfügbar.
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.
Domino treewidth.- A lower bound for treewidth and its consequences.- Tree-width and path-width of comparability graphs of interval orders.- A declarative approach to graph based modeling.- Multilevel graph grammars.- The algorithmic use of hypertree structure and maximum neighbourhood orderings.- On domination elimination orderings and domination graphs.- Complexity of graph covering problems.- Dominoes.- GLB-closures in directed acyclic graphs and their applications.- Minimum vertex cover, distributed decision-making, and communication complexity.- Cartesian products of graphs as spanning subgraphs of de Bruijn graphs.- Specification of graph translators with triple graph grammars.- Using programmed graph rewriting for the formal specification of a configuration management system.- Exponential time analysis of confluent and boundary eNCE graph languages.- Time-optimal tree computations on sparse meshes.- Prefix graphs and their applications.- The complexity of broadcasting in planarand decomposable graphs.- The maximal f-dependent set problem for planar graphs is in NC.- On-line convex planarity testing.- Book embeddings and crossing numbers.- Measuring the distance to series-parallelity by path expressions.- Labelled trees and pairs of input-output permutations in priority queues.- Rankings of graphs.- Bypass strong V-structures and find an isomorphic labelled subgraph in linear time.- Efficient algorithms for a mixed k-partition problem of graphs without specifying bases.- Fugitive-search games on graphs and related parameters.- New approximation results on graph matching and related problems.- New lower bounds and hierarchy results for restricted branching programs.- On-line algorithms for satisfiability problems with uncertainty.- NC algorithms for antidirected hamiltonian paths and cycles in tournaments.- Directed path graph isomorphism.
Domino treewidth.- A lower bound for treewidth and its consequences.- Tree-width and path-width of comparability graphs of interval orders.- A declarative approach to graph based modeling.- Multilevel graph grammars.- The algorithmic use of hypertree structure and maximum neighbourhood orderings.- On domination elimination orderings and domination graphs.- Complexity of graph covering problems.- Dominoes.- GLB-closures in directed acyclic graphs and their applications.- Minimum vertex cover, distributed decision-making, and communication complexity.- Cartesian products of graphs as spanning subgraphs of de Bruijn graphs.- Specification of graph translators with triple graph grammars.- Using programmed graph rewriting for the formal specification of a configuration management system.- Exponential time analysis of confluent and boundary eNCE graph languages.- Time-optimal tree computations on sparse meshes.- Prefix graphs and their applications.- The complexity of broadcasting in planarand decomposable graphs.- The maximal f-dependent set problem for planar graphs is in NC.- On-line convex planarity testing.- Book embeddings and crossing numbers.- Measuring the distance to series-parallelity by path expressions.- Labelled trees and pairs of input-output permutations in priority queues.- Rankings of graphs.- Bypass strong V-structures and find an isomorphic labelled subgraph in linear time.- Efficient algorithms for a mixed k-partition problem of graphs without specifying bases.- Fugitive-search games on graphs and related parameters.- New approximation results on graph matching and related problems.- New lower bounds and hierarchy results for restricted branching programs.- On-line algorithms for satisfiability problems with uncertainty.- NC algorithms for antidirected hamiltonian paths and cycles in tournaments.- Directed path graph isomorphism.