Two comments on minimum spanning trees

MaRDI QIDQ3423061zbMATH OpenFDO

Authors David W. Kravitz

Publication date 20 February 2007

zbMATH Keywords

greedy algorithm

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• The minimum weight spanning tree with constraints
• Minimum spanning trees
• An optimal minimum spanning tree algorithm
• Successive minimum spanning trees
• Minimum spanning trees in networks with varying edge weights

Cited in

(7)

• A greedy algorithm for finding maximum spanning trees in infinite graphs
• An improved minimum spanning tree algorithm based on the same weight of edges
• The minimum weight spanning tree with constraints
• Variations for spanning trees
• scientific article; zbMATH DE number 496232 (Why is no real title available?)
• Modeling combinatorial disjunctive constraints via junction trees
• Minimum spanning trees

This page was built for publication: Two comments on minimum spanning trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3423061)