Abstract | ||
---|---|---|
The notion of a 2-structure is more general than the notion of a graph and less general than the notion of a relational structure . This paper develops the theory of 2-structures, and in particular it demonstrates that each 2-structure can be constructed from (decomposed into) three sorts of “basic” 2-structures. This result is obtained through a (hierarchical) representation of 2-structures by trees. |
Year | DOI | Venue |
---|---|---|
1990 | 10.1016/0304-3975(90)90129-6 | Theor. Comput. Sci. |
Keywords | DocType | Volume |
basic subclasses | Journal | 70 |
Issue | ISSN | Citations |
3 | Theoretical Computer Science | 38 |
PageRank | References | Authors |
5.44 | 0 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
A. Ehrenfeucht | 1 | 1823 | 497.83 |
G. Rozenberg | 2 | 396 | 45.34 |