Approximating the Longest Cycle Problem in Sparse Graphs (Q3149885)

From MaRDI portal
Revision as of 14:44, 28 April 2025 by RedirectionBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Approximating the Longest Cycle Problem in Sparse Graphs
scientific article

    Statements

    Approximating the Longest Cycle Problem in Sparse Graphs (English)
    0 references
    0 references
    0 references
    0 references
    29 September 2002
    0 references
    long paths and cycles
    0 references
    Hamiltonian graphs
    0 references
    approximation algorithms
    0 references

    Identifiers