w-Centroids and Least (w, l)-Central Subtrees in Weighted Trees (Q2958355): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-48749-6_50 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2540391452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A self-stabilizing algorithm for finding weighted centroid in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least central subtrees, center, and centroid of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic Approach to Network Location Problems. II: The<i>p</i>-Medians / rank
 
Normal rank
Property / cites work
 
Property / cites work: The subtree center of a tree / rank
 
Normal rank

Latest revision as of 08:32, 13 July 2024

scientific article
Language Label Description Also known as
English
w-Centroids and Least (w, l)-Central Subtrees in Weighted Trees
scientific article

    Statements

    w-Centroids and Least (w, l)-Central Subtrees in Weighted Trees (English)
    0 references
    0 references
    0 references
    1 February 2017
    0 references
    tree
    0 references
    \(w\)-centroid
    0 references
    \((w,l)\)-central subtree
    0 references
    least \((w,l)\)-central subtree
    0 references

    Identifiers