Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs

DOI10.1007/3-540-45071-8_41zbMath1276.68084OpenAlexW1841951257MaRDI QIDQ3082947

Guido Proietti, Carlo Gaibisso, Richard B. Tan

Publication date: 18 March 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-45071-8_41

zbMATH Keywords

planar graphsminimum spanning treeradio networks survivabilitytransient node failures

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

This page was built for publication: Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs