Showing cs.DSShow all
2 papers · 1 filter
cs.DS2025
Triangle-Covered Graphs: Algorithms, Complexity, and Structure
Amirali Madani, Anil Maheshwari, Babak Miraftab +1
The widely studied edge modification problems ask how to minimally alter a graph to satisfy certain structural properties. In this paper, we introduce and study a new edge modifica…
cs.DS2024
Low-degree spanning trees of -edge-connected graphs in linear time
Dariusz Dereniowski, Janusz Dybizbański, Przemysław Karpiński +2
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 $\lceil \frac{°…