Minimum spanning trees

DOI10.2140/INVOLVE.2009.2.439zbMATH Open1194.05147OpenAlexW2045212439MaRDI QIDQ848784FDOQ848784

Kerry Glavin, Pallavi Jayawant

Publication date: 23 February 2010

Published in: Involve (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/involve.2009.2.439

Recommendations

• On the History of the Minimum Spanning Tree Problem
• Minimum-weight spanning tree algorithms. A survey and empirical study
• Otakar Borůvka on minimum spanning tree problem. Translation of both the 1926 papers, comments, history
• Two comments on minimum spanning trees
• scientific article; zbMATH DE number 1260938

zbMATH Keywords

graph theoryminimum spanning treegraph algorithmMaple

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35)

Cited In (17)

• Reconstructing a minimum spanning tree after deletion of any node
• Variations for spanning trees
• The Filter-Kruskal Minimum Spanning Tree Algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimal Locked Trees
• Minimum Spanning Tree with Neighborhoods
• Title not available (Why is that?)
• Minimum restricted diameter spanning trees.
• The Minimum Spanning Tree Constraint
• Online Minimum Spanning Tree with Advice
• The saga of minimum spanning trees
• Two comments on minimum spanning trees
• Minimum Spanning Trees in k-Dimensional Space
• Rooted Uniform Monotone Minimum Spanning Trees
• Minimum spanning tree cycle intersection problem
• Title not available (Why is that?)

Uses Software

• Maple

This page was built for publication: Minimum spanning trees

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