Minimum-sum dipolar spanning tree in \(\mathbb R^3\) (Q452446)

From MaRDI portal
Revision as of 17:43, 5 July 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
Minimum-sum dipolar spanning tree in \(\mathbb R^3\)
scientific article

    Statements

    Minimum-sum dipolar spanning tree in \(\mathbb R^3\) (English)
    0 references
    0 references
    0 references
    21 September 2012
    0 references
    0 references
    computational geometry
    0 references
    dipolar spanning tree
    0 references
    algorithm
    0 references
    intersection of balls
    0 references
    communication networks
    0 references
    0 references
    0 references