An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs (Q1006382)

From MaRDI portal
Revision as of 17:37, 10 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs
scientific article

    Statements

    An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    24 March 2009
    0 references
    0 references
    Cycle basis
    0 references
    Cycle space
    0 references
    Matrix multiplication
    0 references
    Polynomial algorithms
    0 references