A good algorithm for smallest spanning trees with a degree constraint
From MaRDI portal
Cited in
(20)- The 2-quasi-greedy algorithm for cardinality constrained matroid bases
- Scaling algorithms for network problems
- Exact arborescences, matchings and cycles
- A polynomial algorithm for b-matchings: An alternative approach
- Stochastic spanning tree problem
- Efficient associative algorithm to find the least spanning tree of a graph with a node degree constraint
- Weighted matching with vertex weights: An application to scheduling training sessions in NASA space shuttle cockpit simulators
- The hybrid spanning tree problem
- Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs.
- A multiperiod degree constrained minimal spanning tree problem
- Graphs with largest number of minimum cuts
- Design of capacitated degree constrained min-sum arborescence
- A note on relatives to the Held and Karp 1-tree problem
- Memory-efficient enumeration of constrained spanning trees
- An algorithm for \(k^{\text{th}}\) minimum spanning tree
- Fast algorithm to find 2-factor of minimum weight
- Stochastic bottleneck spanning tree problem
- Small degree out‐branchings
- Matroid optimization with the interleaving of two ordered sets
- On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\)
This page was built for publication: A good algorithm for smallest spanning trees with a degree constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4165177)
