Name
Abstract | ||
|---|---|---|
In this survey the concept of hyperedge replacement is presented as an elementary approach to graph and hypergraph generation. In particular, hyperedge replace- ment graph grammars are discussed as a (hyper)graph-grammatical counterpart to context-free string grammars. To cover a large part of the theory of hyperedge re- placement, structural properties and decision problems, including the membership problem, are addressed. |
Year | Venue | Keywords |
|---|---|---|
1997 | Handbook of Graph Grammars | hyperedge replacement graph grammar,decision problem |
Field | DocType | ISBN |
Tree-adjoining grammar,Context-sensitive grammar,Combinatorics,Graph property,Computer science,Directed graph,Null graph,Graph rewriting,Graph (abstract data type),Voltage graph | Conference | 98-102288-48 |
Citations | PageRank | References |
92 | 4.82 | 57 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| F. Drewes | 1 | 104 | 6.85 |
| Hans-jörg Kreowski | 2 | 298 | 37.05 |
| Annegret Habel | 3 | 234 | 23.18 |