Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree

DOI10.1007/978-3-642-15155-2_14zbMath1287.05145OpenAlexW1895294518MaRDI QIDQ3586079

Guido Proietti, Luciano Gualà, Davide Bilò

Publication date: 3 September 2010

Published in: Mathematical Foundations of Computer Science 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15155-2_14

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree