Name
Abstract | ||
|---|---|---|
Combinatorial properties of dependence graphs are considered. In particular, a characterization is given of sets of unlabelled transitive graphs that can be labelled according to a dependence alphabet. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1006/inco.1994.1089 | Inf. Comput. |
Keywords | Field | DocType |
dependence graph,combinatorial property | Discrete mathematics,Graph,Combinatorics,Transitive reduction,Transitive closure,Mathematics,Transitive relation,Alphabet | Journal |
Volume | Issue | ISSN |
114 | 2 | Information and Computation |
Citations | PageRank | References |
1 | 0.36 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| A. Ehrenfeucht | 1 | 1823 | 497.83 |
| H. J. Hoogeboom | 2 | 15 | 3.70 |
| G. Rozenberg | 3 | 396 | 45.34 |