A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph (Q3769979)

From MaRDI portal
Revision as of 19:16, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
scientific article

    Statements

    A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph (English)
    0 references
    0 references
    1987
    0 references
    cycle basis
    0 references
    polynomial-time algorithm
    0 references
    fundamental set of circuits
    0 references

    Identifiers

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