The two basic linear time Planarity algorithms: Are they the same? (Q5749306)

From MaRDI portal
Revision as of 12:54, 21 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 4183434
Language Label Description Also known as
English
The two basic linear time Planarity algorithms: Are they the same?
scientific article; zbMATH DE number 4183434

    Statements

    The two basic linear time Planarity algorithms: Are they the same? (English)
    0 references
    0 references
    0 references
    1990
    0 references
    planarity testing algorithms
    0 references
    Hopcroft-Tarjan algorithm
    0 references
    Lempel-Even- Cederbaum algorithm
    0 references

    Identifiers