AN OPTIMAL REBUILDING STRATEGY FOR AN INCREMENTAL TREE PROBLEM

DOI10.1142/S0219265907001916MaRDI QIDQ3636563zbMATH OpenOpenAlexFDO

Authors Nicolas Thibault, Christian Laforest

Publication date 30 June 2009

Published in Journal of Interconnection Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0219265907001916

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• An Optimal Rebuilding Strategy for a Decremental Tree Problem
• Constructing incremental sequences in graphs
• Incremental network design with minimum spanning trees
• Optimal trees for minimizing average individual updating cost
• On the computational complexity of dynamic graph problems

Cites work

• Approximation algorithms for NP-hard problems.
• Approximation algorithms for the shortest total path length spanning tree problem
• Dynamic Steiner Tree Problem
• Extending greedy multicast routing to delay sensitive applications
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• Linear bounds for on-line Steiner problems
• Online algorithms. The state of the art

Cited in

(2)

• An Optimal Rebuilding Strategy for a Decremental Tree Problem
• Constructing incremental sequences in graphs

This page was built for publication: AN OPTIMAL REBUILDING STRATEGY FOR AN INCREMENTAL TREE PROBLEM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3636563)