Computing Euclidean maximum spanning trees (Q911288)

From MaRDI portal
Revision as of 16:58, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Computing Euclidean maximum spanning trees
scientific article

    Statements

    title
    Computing Euclidean maximum spanning trees (English)
    0 references
    author
    Clyde l. Monma
    0 references
    Michael S. Paterson
    0 references
    Subhash Suri
    0 references
    Frances F. Yao
    0 references
    published in
    Algorithmica
    0 references
    publication date
    1990
    0 references
    zbMATH Keywords
    spanning trees
    0 references
    furthest-neighbor graph
    0 references
    clusters
    0 references
    diameter-partitioning
    0 references

    Identifiers

    DOI
    10.1007/BF01840396
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    68R10
    0 references
    05C05
    0 references
    zbMATH DE Number
    4141507
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q911288&oldid=12874161"
    Powered by MediaWiki