Near-optimal bounded-degree spanning trees

zbMath0967.68124MaRDI QIDQ1840509

Eric Schmutz, Jennie C. Hansen

Publication date: 11 February 2001

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

spanning treerandom costscomplete directed graph

Mathematics Subject Classification ID

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

This page was built for publication: Near-optimal bounded-degree spanning trees