Name
Abstract | ||
|---|---|---|
A labeled 2-structure g is an edge-labeled directed graph with a reversibility condition on the labels. Each labeled 2-structure g can be represented as a tree, the prime tree of g . We characterize a labeled 2-structure h in terms of the prime tree of a labeled 2-structure g which results from h by removing one element from h . This leads to an O( n 3 ) algorithm for the construction of the prime tree. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1016/0012-365X(94)90107-4 | Discrete Mathematics |
Keywords | Field | DocType |
incremental construction | Prime (order theory),Discrete mathematics,Combinatorics,Directed graph,Mathematics | Journal |
Volume | Issue | ISSN |
128 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| A. Ehrenfeucht | 1 | 1823 | 497.83 |
| Tero Harju | 2 | 714 | 106.10 |
| G. Rozenberg | 3 | 396 | 45.34 |