Pages that link to "Item:Q5936015"
From MaRDI portal
The following pages link to Otakar Borůvka on minimum spanning tree problem. Translation of both the 1926 papers, comments, history (Q5936015):
Displaying 20 items.
- The saga of minimum spanning trees (Q458468) (← links)
- Constant-time local computation algorithms (Q1743110) (← links)
- Traveling salesman games with the Monge property (Q1827808) (← links)
- Minimal congestion trees (Q1877665) (← links)
- The role of randomness in the broadcast congested clique model (Q2051760) (← links)
- Latency, capacity, and distributed minimum spanning trees (Q2119398) (← links)
- A voltage drop limited decentralized electric power distribution network (Q2185525) (← links)
- Majority spanning trees, cotrees and their applications (Q2232225) (← links)
- Physarum in silicon: the Greek motorways study (Q2311224) (← links)
- Low-congestion shortcuts without embedding (Q2657278) (← links)
- Relation-algebraic verification of Borůvka's minimum spanning tree algorithm (Q2695356) (← links)
- THE MINIMUM SPANNING TREE PROBLEM: Jarník's solution in historical and present context (Q3439600) (← links)
- The Range of Topological Effects on Communication (Q3449503) (← links)
- Distributed Broadcast Revisited: Towards Universal Optimality (Q3449512) (← links)
- Extending the Power Watershed Framework Thanks to $\Gamma$-Convergence (Q4689664) (← links)
- Introduction to local certification (Q5024672) (← links)
- (Q5090922) (← links)
- Triplet Merge Trees (Q5147726) (← links)
- A theoretical and computational study of green vehicle routing problems (Q6173935) (← links)
- Models of random subtrees of a graph (Q6183888) (← links)
