Low-degree spanning trees of $2$-edge-connected graphs in linear time
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910670885224448 |
|---|---|
| author | Dereniowski, Dariusz Dybizbański, Janusz Karpiński, Przemysław Zakrzewski, Michał Żyliński, Paweł |
| author_facet | Dereniowski, Dariusz Dybizbański, Janusz Karpiński, Przemysław Zakrzewski, Michał Żyliński, Paweł |
| contents | We present a simple linear-time algorithm that finds a spanning tree $T$ of a given $2$-edge-connected graph $G$ such that each vertex $v$ of $T$ has degree at most $\lceil \frac{°_G(v)}{2}\rceil + 1$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_20137 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Low-degree spanning trees of $2$-edge-connected graphs in linear time Dereniowski, Dariusz Dybizbański, Janusz Karpiński, Przemysław Zakrzewski, Michał Żyliński, Paweł Data Structures and Algorithms G.2.2, F.2.2 We present a simple linear-time algorithm that finds a spanning tree $T$ of a given $2$-edge-connected graph $G$ such that each vertex $v$ of $T$ has degree at most $\lceil \frac{°_G(v)}{2}\rceil + 1$. |
| title | Low-degree spanning trees of $2$-edge-connected graphs in linear time |
| topic | Data Structures and Algorithms G.2.2, F.2.2 |
| url | https://arxiv.org/abs/2410.20137 |