On recursive computation of minimum spanning trees for special partial graphs
From MaRDI portal
Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Directed graphs (digraphs), tournaments (05C20) Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Integer programming (90C10) Applications of graph theory to circuits and networks (94C15)
Recommendations
- scientific article; zbMATH DE number 3974972
- On generalized minimum spanning trees
- On the generalized minimum spanning tree problem
- A generalization of the minimum branch vertices spanning tree problem
- On constructing minimum spanning trees in \(R_ 1^ k\)
- An algorithm for \(k^{\text{th}}\) minimum spanning tree
- Minimum spanning trees in d dimensions
- scientific article; zbMATH DE number 1436136
- On Minimum Spanning Trees and Determinants
- Distributed Computing - IWDC 2003
Cites work
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- A note on two problems in connexion with graphs
- Finding Minimum Spanning Trees
- Minimal Test Set for Diagnosing a Tree System
- On the shortest spanning subtree of a graph and the traveling salesman problem
- The Traveling-Salesman Problem and Minimum Spanning Trees
Cited in
(2)
This page was built for publication: On recursive computation of minimum spanning trees for special partial graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3690607)
