Fast enumeration algorithms for non-crossing geometric graphs (Q5896957)

From MaRDI portal
Revision as of 22:32, 1 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5598793
Language Label Description Also known as
English
Fast enumeration algorithms for non-crossing geometric graphs
scientific article; zbMATH DE number 5598793

    Statements

    Fast enumeration algorithms for non-crossing geometric graphs (English)
    0 references
    0 references
    0 references
    27 August 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    enumeration
    0 references
    non-crossing geometric graphs
    0 references
    triangulations
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references