An algorithm for constructing a \(k\)-tree for a \(k\)-connected matroid (Q2343464)

From MaRDI portal
Revision as of 00:45, 10 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
An algorithm for constructing a \(k\)-tree for a \(k\)-connected matroid
scientific article

    Statements

    An algorithm for constructing a \(k\)-tree for a \(k\)-connected matroid (English)
    0 references
    0 references
    0 references
    5 May 2015
    0 references
    \(k\)-connected matroid
    0 references
    tree decomposition
    0 references
    \(k\)-tree
    0 references
    \(k\)-separation
    0 references

    Identifiers