Incremental construction of 2-structures (Q1322177): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Homomorphism Theorem for Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modules of Coherent Binary Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Algorithm for the Decomposition of Graphs and Posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of 2-structures. I: Clans, basic subclasses, and morphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of 2-structures. II: Representation through labeled tree families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3865813 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partially ordered sets and their comparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs indecomposable with respect to the X-join / rank
 
Normal rank

Latest revision as of 14:31, 22 May 2024

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
    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
    graph
    0 references
    labeled 2-structure
    0 references
    directed graph
    0 references
    labels
    0 references
    tree
    0 references
    polynomial algorithm
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references