Maintaining centdians in a fully dynamic forest with top trees (Q479062): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68P05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6377068 / rank
 
Normal rank
Property / zbMATH Keywords
 
fully dynamic forest
Property / zbMATH Keywords: fully dynamic forest / rank
 
Normal rank
Property / zbMATH Keywords
 
centdian
Property / zbMATH Keywords: centdian / rank
 
Normal rank
Property / zbMATH Keywords
 
top tree
Property / zbMATH Keywords: top tree / rank
 
Normal rank
Property / zbMATH Keywords
 
nonlocal search
Property / zbMATH Keywords: nonlocal search / rank
 
Normal rank
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.1016/j.dam.2014.09.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1991526858 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining information in fully dynamic trees with top trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2721967 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic and static algorithms for optimal placement of resources in a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality in the Cent-Dian of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A data structure for dynamic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for thep-centdian problem on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The backup 2‐center and backup 2‐median problems on trees / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:27, 9 July 2024

scientific article
Language Label Description Also known as
English
Maintaining centdians in a fully dynamic forest with top trees
scientific article

    Statements

    Maintaining centdians in a fully dynamic forest with top trees (English)
    0 references
    0 references
    5 December 2014
    0 references
    0 references
    fully dynamic forest
    0 references
    centdian
    0 references
    top tree
    0 references
    nonlocal search
    0 references
    0 references