Graph-Theoretic Concepts in Computer Science

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

AvErnst W. Mayr,Gunther Schmidt

Häftad, Engelska, 1995

Del i serien Lecture Notes in Computer Science

541 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

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

Utgivningsdatum:1995-03-17
Mått:155 x 233 x 24 mm
Vikt:657 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:425
Upplaga:1995
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540590712

Utforska kategorier

Innehållsförteckning

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.