scientific article; zbMATH DE number 2201897

MaRDI QIDQ5314095zbMATH OpenFDO

Authors Petrica Pop, Ioana Zelina, Corina Pop Sitar

Publication date 2 September 2005

zbMATH Keywords

graph theoryKruskal algorithmPrim algorithm

Mathematics Subject Classification ID

Trees (05C05) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 2037815
• On the generalized minimum spanning tree problem
• An approximation algorithm for the least version of the generalized minimum spanning tree problem
• scientific article; zbMATH DE number 5036665
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm
• Improving on branch-and-cut algorithms for generalized minimum spanning trees
• The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
• A note on the complexity of the generalized minimum spanning tree problem
• On generalized minimum spanning trees

Cited in

(7)

• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• Efficient minimum spanning tree algorithms on the reconfigurable mesh
• On some polynomial solvable cases of the generalized minimum spanning tree problem
• Exact Algorithms for Generalized Combinatorial Optimization Problems
• Solving the generalized minimum spanning tree problem with simulated annealing
• scientific article; zbMATH DE number 2037815 (Why is no real title available?)
• scientific article; zbMATH DE number 5036665 (Why is no real title available?)

This page was built for publication:

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