Graph-Theoretic Concepts in Computer Science: 20th International Workshop. WG '94, Herrsching, Germany, June 16 - 18, 1994. Proceedings, 20. sējumsErnst 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
6.–10. rezultāts no 22.
112. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
113. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
114. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
125. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
132. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
Saturs
25 | |
A Declarative Approach to Graph Based Modeling | 38 |
Multilevel Graph Grammars | 51 |
The Algorithmic Use of Hypertree Structure and Maximum | 65 |
On Domination Elimination Orderings and Domination Graphs | 81 |
Dominoes | 106 |
GLBClosures in Directed Acyclic Graphs and Their Applications | 121 |
Cartesian Products of Graphs as Spanning Subgraphs of De Bruijn | 140 |
Using Programmed Graph Rewriting for the Formal Specification of | 164 |
Citi izdevumi - Skatīt visu
Graph-Theoretic Concepts in Computer Science: 20th International Workshop ... Ernst W. Mayr,Gunther Schmidt,Gottfried Tinhofer Priekšskatījums nav pieejams - 2014 |
Bieži izmantoti vārdi un frāzes
ADHP adjacent algorithm application assume biconnected graph binary tree bipartite graphs Boolean branching programs broadcast chordal graphs chordless cycle class of graphs color complete graph complexity component Computer Science construction contains corresponding cycle decomposition defined Definition degree denote domino dually chordal graphs edge embedding eNCE graph grammars encoding exists fugitive function G₁ given glb-closure graph G graph rewriting Horn formula hyperedge hypergraph induced subgraph input integer interval graph isomorphism label Lemma Let G line graph linear lower bound matching Max-f-DS maximal cliques maximum morphism multilevel graph node nonterminal nodes NP-complete number of vertices O(logn obtain pair parallel partition path-width planar graph polynomial prefix graph problem without bases Proc processors production Proof r-dominating recursively reduction result search number searchers sequence simplicial solved specification st-dag subgraph of G subset Theorem treewidth triple v₁ variables weight