An approximation algorithm for the Hamiltonian walk problem on maximal planar graphs (Q1838978)

From MaRDI portal
Revision as of 08:54, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An approximation algorithm for the Hamiltonian walk problem on maximal planar graphs
scientific article

    Statements

    An approximation algorithm for the Hamiltonian walk problem on maximal planar graphs (English)
    0 references
    0 references
    0 references
    0 references
    1983
    0 references
    hamiltonian walk
    0 references
    generalized hamiltonian cycle problem
    0 references
    closed spanning walk
    0 references

    Identifiers