An algorithm for connecting n points with a minimum number of crossings (Q2522668)

From MaRDI portal
Revision as of 20:48, 11 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An algorithm for connecting n points with a minimum number of crossings
scientific article

    Statements

    title
    An algorithm for connecting n points with a minimum number of crossings (English)
    0 references
    author
    Yanyan Li
    0 references
    published in
    Calcolo
    0 references
    publication date
    1964
    0 references
    zbMATH Keywords
    topology
    0 references

    Identifiers

    DOI
    10.1007/BF02576900
    0 references
    zbMATH DE Number
    3228462
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2522668&oldid=34510832"
    Powered by MediaWiki