Minimum-sum dipolar spanning tree in \(\mathbb R^3\) (Q452446): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65D18 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 94C05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6084812 / rank
 
Normal rank
Property / zbMATH Keywords
 
computational geometry
Property / zbMATH Keywords: computational geometry / rank
 
Normal rank
Property / zbMATH Keywords
 
dipolar spanning tree
Property / zbMATH Keywords: dipolar spanning tree / rank
 
Normal rank
Property / zbMATH Keywords
 
algorithm
Property / zbMATH Keywords: algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
intersection of balls
Property / zbMATH Keywords: intersection of balls / rank
 
Normal rank
Property / zbMATH Keywords
 
communication networks
Property / zbMATH Keywords: communication networks / rank
 
Normal rank

Revision as of 11:44, 30 June 2023

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