An Optimal Rebuilding Strategy for a Decremental Tree Problem

DOI10.1007/11780823_13MaRDI QIDQ3613650zbMATH OpenOpenAlexFDO

Authors Nicolas Thibault, Christian Laforest

Publication date 12 March 2009

Published in Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11780823_13

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Distance in graphs (05C12) Connectivity (05C40)

Recommendations

• AN OPTIMAL REBUILDING STRATEGY FOR AN INCREMENTAL TREE PROBLEM
• Optimal on-line decremental connectivity in trees
• Minimizing diameters of dynamic trees
• Decremental Dynamic Connectivity
• Dynamic Steiner Tree Problem

Cited in

(3)

• Preference summaries for stochastic tree rollback
• AN OPTIMAL REBUILDING STRATEGY FOR AN INCREMENTAL TREE PROBLEM
• Optimal on-line decremental connectivity in trees

This page was built for publication: An Optimal Rebuilding Strategy for a Decremental Tree Problem

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