Work

Low-degree spanning trees of 2-edge-connected graphs in linear time

Year: 2025

Type: article

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{\deg _G(v)}{2}\rceil + 1$$ .

Source: Journal of Combinatorial Optimization

DOI: 10.1007/s10878-025-01368-2

Authors: Dariusz Dereniowski, Janusz Dybizbański, Przemysław Karpiński, Michał Zakrzewski, Paweł Żyliński

Institutions: Gdańsk University of Technology, University of Gdańsk, Intel (Poland)

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $3,190

Funders: Intel Corporation, Narodowe Centrum Nauki

Award: G8977255895

OpenAlex ID: W4415537540

FWCI:

Cites: 6

Cited by:

Related to: