Using sparsification for parametric minimum spanning tree problems

DOI10.1007/3-540-61422-2_128zbMath1502.68224MaRDI QIDQ5054811

Giora Slutzki, David Eppstein, David Fernández Baca

Publication date: 9 December 2022

Published in: Algorithm Theory — SWAT'96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61422-2_128

Mathematics Subject Classification ID

68W40: Analysis of algorithms

05C05: Trees

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

05C85: Graph algorithms (graph-theoretic aspects)