A good algorithm for smallest spanning trees with a degree constraint
From MaRDI portal
Publication:4165177
DOI10.1002/net.3230080304zbMath0384.90105OpenAlexW2033250446MaRDI QIDQ4165177
Publication date: 1978
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230080304
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Applications of graph theory to circuits and networks (94C15)
Related Items (21)
Weighted matching with vertex weights: An application to scheduling training sessions in NASA space shuttle cockpit simulators ⋮ The 2-quasi-greedy algorithm for cardinality constrained matroid bases ⋮ Scaling algorithms for network problems ⋮ The hybrid spanning tree problem ⋮ On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\) ⋮ Memory-efficient enumeration of constrained spanning trees ⋮ Exact arborescences, matchings and cycles ⋮ Small degree out‐branchings ⋮ An algorithm for \(k^{\text{th}}\) minimum spanning tree ⋮ Fast algorithm to find 2-factor of minimum weight ⋮ A polynomial algorithm for b-matchings: An alternative approach ⋮ Graphs with largest number of minimum cuts ⋮ Stochastic spanning tree problem ⋮ Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs. ⋮ A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees ⋮ A note on relatives to the Held and Karp 1-tree problem ⋮ Efficient associative algorithm to find the least spanning tree of a graph with a node degree constraint ⋮ Design of capacitated degree constrained min-sum arborescence ⋮ Stochastic bottleneck spanning tree problem ⋮ A multiperiod degree constrained minimal spanning tree problem ⋮ Matroid optimization with the interleaving of two ordered sets
This page was built for publication: A good algorithm for smallest spanning trees with a degree constraint
