Near-linear time algorithm for approximate minimum degree spanning trees

DOI10.1007/978-3-030-61792-9_2OpenAlexW3116849537MaRDI QIDQ2081596

Ran Duan, Haoqing He, Tianyi Zhang

Publication date: 13 October 2022

Full work available at URL: https://arxiv.org/abs/1712.09166

zbMATH Keywords

graph algorithmapproximate algorithmminimum degree spanning tree

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)

This page was built for publication: Near-linear time algorithm for approximate minimum degree spanning trees