π
π
The Cartographer
Low-degree spanning trees of $2$-edge-connected graphs in linear time
October 26, 2024 Β· Declared Dead Β· π Journal of combinatorial optimization
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Dariusz Dereniowski, Janusz DybizbaΕski, PrzemysΕaw KarpiΕski, MichaΕ Zakrzewski, PaweΕ Ε»yliΕski
arXiv ID
2410.20137
Category
cs.DS: Data Structures & Algorithms
Citations
0
Venue
Journal of combinatorial optimization
Last Checked
5 months ago
Abstract
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$.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted