Low-degree spanning trees of $2$-edge-connected graphs in linear time
Data Structures and Algorithms
2024-10-29 v1
Abstract
We present a simple linear-time algorithm that finds a spanning tree of a given -edge-connected graph such that each vertex of has degree at most .
Cite
@article{arxiv.2410.20137,
title = {Low-degree spanning trees of $2$-edge-connected graphs in linear time},
author = {Dariusz Dereniowski and Janusz Dybizbański and Przemysław Karpiński and Michał Zakrzewski and Paweł Żyliński},
journal= {arXiv preprint arXiv:2410.20137},
year = {2024}
}