Efficient approximation algorithms for shortest cycles in undirected graphs (Q987804)

From MaRDI portal
Revision as of 02:52, 3 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
Efficient approximation algorithms for shortest cycles in undirected graphs
scientific article

    Statements

    Efficient approximation algorithms for shortest cycles in undirected graphs (English)
    0 references
    0 references
    0 references
    16 August 2010
    0 references
    graph algorithm
    0 references
    approximation algorithm
    0 references
    shortest cycle
    0 references
    undirected graph
    0 references
    time complexity
    0 references

    Identifiers

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