Space efficient algorithms for some graph theoretical problems (Q1160148)

From MaRDI portal
Revision as of 03:24, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Space efficient algorithms for some graph theoretical problems
scientific article

    Statements

    Space efficient algorithms for some graph theoretical problems (English)
    0 references
    0 references
    0 references
    0 references
    1982
    0 references
    0 references
    0 references
    0 references
    0 references
    deterministic algorithms
    0 references
    planarity testing
    0 references
    producing a plane embedding
    0 references
    minimum cost spanning trees
    0 references