A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
INCREMENTAL CONSTRUCTION OF 2-STRUCTURES
Tekijät: EHRENFEUCHT A, HARJU T, ROZENBERG G
Kustantaja: ELSEVIER SCIENCE BV
Julkaisuvuosi: 1994
Lehti:: Discrete Mathematics
Tietokannassa oleva lehden nimi: DISCRETE MATHEMATICS
Lehden akronyymi: DISCRETE MATH
Vuosikerta: 128
Numero: 1-3
Aloitussivu: 113
Lopetussivu: 141
Sivujen määrä: 29
ISSN: 0012-365X
DOI: https://doi.org/10.1016/0012-365X(94)90107-4
Tiivistelmä
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(n3) algorithm for the construction of the prime tree.
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(n3) algorithm for the construction of the prime tree.
Turun yliopiston Tutkimustietojärjestelmän portaali