Bounded degree spanning trees (extended abstract)
From MaRDI portal
Publication:826078
DOI10.1007/3-540-63397-9_9zbMath1477.68215OpenAlexW123718951MaRDI QIDQ826078
Artur Czumaj, Willy-B. Strothmann
Publication date: 20 December 2021
Full work available at URL: https://doi.org/10.1007/3-540-63397-9_9
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Connectivity (05C40)
Related Items
Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree, Greedy routing via embedding graphs onto semi-metric spaces, Reconfiguration of spanning trees with degree constraints or diameter constraints, Edge‐decomposing graphs into coprime forests, Decomposing graphs into paths of fixed length, Connectivity Oracles for Graphs Subject to Vertex Failures, Complexity of some arc-partition problems for digraphs, Spanning trees and spanning Eulerian subgraphs with small degrees