Linear verification for spanning trees
From MaRDI portal
Publication:1066909
DOI10.1007/BF02579443zbMATH Open0579.05031OpenAlexW2152506249MaRDI QIDQ1066909FDOQ1066909
Authors: János Komlós 
Publication date: 1985
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579443
Recommendations
- An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees
- Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time
- An inverse-Ackermann type lower bound for online minimum spanning tree verification
- A simpler minimum spanning tree verification algorithm
- A simpler minimum spanning tree verification algorithm
Cites Work
Cited In (15)
- Polynomial testing of the query Is \(a^ b\geq c^ d?\) with application to finding a minimal cost reliability ratio spanning tree
- Title not available (Why is that?)
- Succinct indices for path minimum, with applications
- Distributed verification of minimum spanning trees
- An optimal EREW PRAM algorithm for minimum spanning tree verification
- Trans-dichotomous algorithms for minimum spanning trees and shortest paths
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- A simpler minimum spanning tree verification algorithm
- The saga of minimum spanning trees
- A simpler minimum spanning tree verification algorithm
- Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems
- The algebraic Monge property and path problems
- On Cartesian trees and range minimum queries
This page was built for publication: Linear verification for spanning trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1066909)
