A1 Refereed original research article in a scientific journal
INCREMENTAL CONSTRUCTION OF 2-STRUCTURES
Authors: EHRENFEUCHT A, HARJU T, ROZENBERG G
Publisher: ELSEVIER SCIENCE BV
Publication year: 1994
Journal:: Discrete Mathematics
Journal name in source: DISCRETE MATHEMATICS
Journal acronym: DISCRETE MATH
Volume: 128
Issue: 1-3
First page : 113
Last page: 141
Number of pages: 29
ISSN: 0012-365X
DOI: https://doi.org/10.1016/0012-365X(94)90107-4
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(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.
UTU Research Portal