Results 11 to 20 of about 133,936 (292)
Near-linear Time Algorithm for Approximate Minimum Degree Spanning Trees [PDF]
, 2020 Given a graph $G = (V, E)$, we wish to compute a spanning tree whose maximum vertex degree, i.e. tree degree, is as small as possible. Computing the exact optimal solution is known to be NP-hard, since it generalizes the Hamiltonian path problem. For the
G Yao +6 more
core +2 more sources
Matroidal Degree-Bounded Minimum Spanning Trees [PDF]
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2011 We consider the minimum spanning tree (MST) problem under the restriction that for every vertex v, the edges of the tree that are adjacent to v satisfy a given family of constraints.
Zenklusen, Rico
core +3 more sources
Distributed Minimum Degree Spanning Trees [PDF]
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019 The minimum degree spanning tree (MDST) problem requires the construction of a spanning tree T for graph G, such that the maximum degree of T is the smallest among all spanning trees of G. Let d be this MDST degree for a given graph. In this paper, we present a randomized distributed approximation algorithm for the MDST problem that constructs a ...
Michael Dinitz +3 more
openaire +1 more source
Low-degree minimum spanning trees [PDF]
Discrete & Computational Geometry, 1995 The paper studies the maximum vertex degree of a minimum spanning tree (MST) in the spaces with \(L_p\) norm. It is proved that the maximum vertex degree over all MSTs is equal to the Hadwiger number of the corresponding unit ball, whereby the Hadwiger number \(H(B)\) of an open convex set \(B\) is the maximum number of neighbors of \(B\) considered ...
Robins, G., Salowe, J.S.
openaire +2 more sources
Spanning trees with minimum weighted degrees [PDF]
Information Processing Letters, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ghodsi, Mohammad +5 more
openaire +2 more sources
Minimum bottleneck spanning trees with degree bounds [PDF]
Networks, 2016 Given a graph G with edge lengths, the minimum bottleneck spanning tree (MBST) problem is to find a spanning tree where the length of the longest edge in tree is minimum. It is a well‐known fact that every minimum spanning tree (MST) is a minimum bottleneck spanning tree. In this article, we introduce the δ‐MBST problem, which is the problem of finding
Andersen, PJ, Ras, CJ
openaire +2 more sources
Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem [PDF]
Algorithmica, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Könemann, Jochen +2 more
openaire +2 more sources
Degree-bounded minimum spanning trees
Discrete Applied Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jothi, Raja, Raghavachari, Balaji
openaire +1 more source
Self-stabilizing minimum degree spanning tree within one from the optimal degree [PDF]
Journal of Parallel and Distributed Computing, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Blin, Lélia +2 more
openaire +5 more sources
Spanning Trees Minimizing Branching Costs [PDF]
Discrete Mathematics & Theoretical Computer ScienceThe Minimum Branch Vertices Spanning Tree problem aims to find a spanning tree $T$ in a given graph $G$ with the fewest branch vertices, defined as vertices with a degree three or more in $T$.
Luisa Gargano, Adele A. Rescigno
doaj +1 more source