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.

Produktinformation

Utgivningsdatum1995-03-17
Mått155 x 233 x 24 mm
Vikt657 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor425
Upplaga1995
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540590712

Tillhör följande kategorier

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.

Mer från samma författare

Exploring New Frontiers of Theoretical Informatics

Jean-Jacques Lévy, Ernst W. Mayr, John C. Mitchell

Inbunden, 2004

2 219 kr

Del 155

Exploring New Frontiers of Theoretical Informatics

Jean-Jacques Lévy, Ernst W. Mayr, John C. Mitchell

Häftad, 2011

2 219 kr

Del 8136

Computer Algebra in Scientific Computing

Vladimir P. Gerdt, Wolfram Koepf, Ernst W. Mayr, Evgenii V. Vorozhtsov

Häftad, 2013

719 kr

Computer Algebra in Scientific Computing

V. G. Ganzha, Victor G. Ganzha, Ernst W. Mayr, Evgenii V. Vorozhtsov

Häftad, 2005

719 kr

Computer Algebra in Scientific Computing

V. G. Ganzha, Mayr E W, Victor Gregor'e Ganzha, Ernst W. Mayr, Evgenii Vasilev Vorozhtsov

Inbunden, 2001

1 149 kr

STACS 94

Patrice Enjalbert, Ernst W. Mayr, Klaus W. Wagner

Häftad, 1994

749 kr

STACS 95

Ernst W. Mayr, Claude Puech

Häftad, 1995

1 479 kr

Lectures on Proof Verification and Approximation Algorithms

Ernst W. Mayr, Hans Jürgen Prömel, Angelika Steger

Häftad, 1998

749 kr

Computer Algebra in Scientific Computing

Vladimir P. Gerdt, Ernst W. Mayr, Evgenii V. Vorozhtsov

Häftad, 2009

749 kr

Computer Science -- Theory and Applications

Farid M. Ablaev, Ernst W. Mayr

Häftad, 2010

719 kr

Mer från samma serie

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

749 kr

COLOG-88

Per Martin-Löf, Grigori Mints

Häftad, 1990

719 kr

Compiler Construction

Albert Cohen

Häftad, 2014

719 kr

Del 16375

Interactive Storytelling

María Cecilia Reyes, Frank Nack

Häftad, 2025

719 kr

Theory of Cryptography

Yehuda Lindell

Häftad, 2014

749 kr

Computer Science Logic

Dirk van Dalen, Marc Bezem

Häftad, 1997

749 kr

Reliable Software Technology – Ada-Europe 2005

Tullio Vardanega, Andy Wellings

Häftad, 2005

749 kr

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki - Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries, Häftad

Del 16376

Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki

Häftad, 2026

1 219 kr

Objects and Databases

Alan Dearle, Roberto V. Zicari

Häftad, 2010

749 kr

Anna Schroder, Xiang Li, Tanveer Syeda-Mahmood, Neil P. Oxtoby, Alexandra Young, Alessa Hering, Tejas S. Mathai, Pritam Mukherjee, Sven Kuckertz, Tiantian He, Isaac Llorente-Saguer, Andreas Maier, Satyananda Kashyap, Hayit Greenspan, Anant Madabhushi - Medical Image Computing and Computer Assisted Intervention – MICCAI 2024 Workshops, Häftad

Del 15401

Medical Image Computing and Computer Assisted Intervention – MICCAI 2024 Workshops

Anna Schroder, Xiang Li, Tanveer Syeda-Mahmood, Neil P. Oxtoby, Alexandra Young, Alessa Hering, Tejas S. Mathai, Pritam Mukherjee, Sven Kuckertz, Tiantian He, Isaac Llorente-Saguer, Andreas Maier, Satyananda Kashyap, Hayit Greenspan, Anant Madabhushi

Häftad, 2025

969 kr

Du kanske också är intresserad av

Graph-Theoretic Concepts in Computer Science

Gottfried Tinhofer, Gunther Schmidt

Häftad, 1987

749 kr

Graph-Theoretic Concepts in Computer Science

Ernst W. Mayr

Häftad, 2016

719 kr

Del 14093

Graph-Theoretic Concepts in Computer Science

Daniël Paulusma, Bernard Ries

Häftad, 2023

1 149 kr

Graph-Theoretic Concepts in Computer Science

Ulrik Brandes, Dorothea Wagner

Häftad, 2000

749 kr

Del 16124

Graph-Theoretic Concepts in Computer Science

Henning Fernau, Philipp Kindermann

Häftad, 2026

2 579 kr

Graph-Theoretic Concepts in Computer Science

Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk

Häftad, 2013

719 kr

Graph-Theoretic Concepts in Computer Science

Rolf H. Möhring

Häftad, 1991

749 kr

Del 8747

Graph-Theoretic Concepts in Computer Science

Dieter Kratsch, Ioan Todinca

Häftad, 2014

719 kr

Graph-Theoretic Concepts in Computer Science

Juraj Hromkovič, Ondrej Sykora

Häftad, 1998

749 kr

Graph-Theoretic Concepts in Computer Science

Ludek Kucera

Häftad, 2002

749 kr

Del i serien Lecture Notes in Computer Science

Graph-Theoretic Concepts in Computer Science

20th International Workshop. WG '94, Herrsching, Germany, June 16 - 18, 1994. Proceedings

Häftad, Engelska, 1995

AvErnst W. Mayr,Gunther Schmidt,Gottfried Tinhofer

719 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (10)

Häftad

719 kr

Skickas inom 10-15 vardagar

Häftad

949 kr

Skickas inom 10-15 vardagar

Häftad

719 kr

Skickas inom 10-15 vardagar

Häftad

1 219 kr

Skickas inom 10-15 vardagar

Häftad

1 069 kr

Skickas inom 10-15 vardagar

Häftad

1 149 kr

Skickas inom 5-8 vardagar

Häftad

1 149 kr

Skickas inom 5-8 vardagar

Häftad

2 579 kr

Skickas inom 10-15 vardagar

Häftad

719 kr

Skickas inom 10-15 vardagar

Häftad

719 kr

Skickas inom 10-15 vardagar

Produktinformation

Utgivningsdatum1995-03-17
Mått155 x 233 x 24 mm
Vikt657 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor425
Upplaga1995
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540590712

Tillhör följande kategorier

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.