Otakar Borůvka on minimum spanning tree problem. Translation of both the 1926 papers, comments, history

DOI10.1016/S0012-365X(00)00224-7zbMath0999.01019OpenAlexW2071346873WikidataQ55895455 ScholiaQ55895455MaRDI QIDQ5936015

No author found.

Publication date: 2 December 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00224-7

Mathematics Subject Classification ID

Combinatorial optimization (90C27) History of mathematics in the 20th century (01A60) Collected or selected works; reprintings or translations of classics (01A75) History of operations research and mathematical programming (90-03)

Related Items (20)

Latency, capacity, and distributed minimum spanning trees ⋮ Minimal congestion trees ⋮ The Range of Topological Effects on Communication ⋮ Distributed Broadcast Revisited: Towards Universal Optimality ⋮ Low-congestion shortcuts without embedding ⋮ A voltage drop limited decentralized electric power distribution network ⋮ A theoretical and computational study of green vehicle routing problems ⋮ Models of random subtrees of a graph ⋮ Relation-algebraic verification of Borůvka's minimum spanning tree algorithm ⋮ The saga of minimum spanning trees ⋮ Majority spanning trees, cotrees and their applications ⋮ Triplet Merge Trees ⋮ Constant-time local computation algorithms ⋮ Unnamed Item ⋮ Extending the Power Watershed Framework Thanks to $\Gamma$-Convergence ⋮ The role of randomness in the broadcast congested clique model ⋮ Physarum in silicon: the Greek motorways study ⋮ Traveling salesman games with the Monge property ⋮ THE MINIMUM SPANNING TREE PROBLEM: Jarník's solution in historical and present context ⋮ Introduction to local certification

This page was built for publication: Otakar Borůvka on minimum spanning tree problem. Translation of both the 1926 papers, comments, history