On symbolic OBDD-based algorithms for the minimum spanning tree problem (Q443706)

From MaRDI portal
Revision as of 13:51, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On symbolic OBDD-based algorithms for the minimum spanning tree problem
scientific article

    Statements

    On symbolic OBDD-based algorithms for the minimum spanning tree problem (English)
    0 references
    0 references
    13 August 2012
    0 references
    minimum spanning tree algorithms
    0 references
    ordered binary decision diagrams
    0 references
    symbolic algorithms
    0 references
    transitive closure
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references