Graph-Theoretic Concepts in Computer Science: 20th International Workshop. WG '94, Herrsching, Germany, June 16 - 18, 1994. Proceedings, 20. sējums

Pirmais vāks
Ernst W. Mayr, Gunther Schmidt, Gottfried Tinhofer
Springer Science & Business Media, 1995. gada 17. marts - 414 lappuses
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.

No grāmatas satura

Lietotāju komentāri - Rakstīt atsauksmi

Ierastajās vietās neesam atraduši nevienu atsauksmi.

Saturs

A Lower Bound for Treewidth and Its Consequences
25
R Garbe
36
Multilevel Graph Grammars
51
The Algorithmic Use of Hypertree Structure and Maximum
65
On Domination Elimination Orderings and Domination Graphs
81
Complexity of Graph Covering Problems
93
Dominoes
106
GLBClosures in Directed Acyclic Graphs and Their Applications
121
Minimum Vertex Cover Distributed DecisionMaking
130
Cartesian Products of Graphs as Spanning Subgraphs of De Bruijn
140
Using Programmed Graph Rewriting for the Formal Specification of
164
B Westfechtel 164
411
Autortiesības

Citi izdevumi - Skatīt visu

Bieži izmantoti vārdi un frāzes

Bibliogrāfiskā informācija