Incremental construction of 2-structures (Q1322177)

From MaRDI portal
Revision as of 13:21, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Incremental construction of 2-structures
scientific article

    Statements

    Incremental construction of 2-structures (English)
    0 references
    0 references
    0 references
    0 references
    15 September 1994
    0 references
    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 trees arising this way are characterized and a polynomial algorithm to recognize them is given.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph
    0 references
    labeled 2-structure
    0 references
    directed graph
    0 references
    labels
    0 references
    tree
    0 references
    polynomial algorithm
    0 references