Graph-Theoretic Concepts in Computer Science: 20th International Workshop. WG '94, Herrsching, Germany, June 16 - 18, 1994. Proceedings, 20. sējums
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.
Lietotāju komentāri - Rakstīt atsauksmi
Ierastajās vietās neesam atraduši nevienu atsauksmi.
A Declarative Approach to Graph Based Modeling
Multilevel Graph Grammars
The Algorithmic Use of Hypertree Structure and Maximum
On Domination Elimination Orderings and Domination Graphs
Complexity of Graph Covering Problems
Cartesian Products of Graphs as Spanning Subgraphs of De Bruijn
Specification of Graph Translators with Triple Graph Grammars
Using Programmed Graph Rewriting for the Formal Specification of
B Westfechtel 164
Citi izdevumi - Skatīt visu
adjacent algorithm allowable application approach assigned assume begin broadcast called chordal graphs clique color complexity component Computer Computer Science condition connected consider consists constant construction contains corresponding covering cycle defined Definition denote derived described directed domino drawing edge efficient elements equal example exists expression extended factoring Figure fugitive function given graph G graph grammars Hence holds induced input isomorphism known label language least Lemma length Let G linear lower bound matching maximal maximum node Note obtain operations otherwise pair parallel partition path possible problem Proceedings processors production Proof properties prove ranking reduction replaced represented respect restricted result root satisfies sequence shown solved specification step structure subgraph subset Theorem Theory tree triple variables vertex vertices weight