On the public citation graph
Linear verification for spanning trees
0 signed · 61 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0020-0190(75)90056-3openalex-snapshot
An 0(|E|loglog|V|) algorithm for finding minimum spanning trees
inferredcites →https://doi.org/10.1109/sfcs.1980.6openalex-snapshot
A linear time algorithm for the lowest common ancestors problem
inferredcites →https://doi.org/10.1145/322154.322161openalex-snapshot
Applications of Path Compression on Balanced Trees
inferredcites →https://doi.org/10.1145/322203.322206openalex-snapshot
Information Bounds Are Weak in the Shortest Distance Problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11602613_96openalex-snapshot
Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_83openalex-snapshot
A simpler minimum spanning tree verification algorithm
inferred← citeshttps://doi.org/10.1007/3-540-63774-5_98openalex-snapshot
Solving and approximating combinatorial optimization problems (Towards MAX CUT and TSP)
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_325openalex-snapshot
Randomized Minimum Spanning Tree
inferred← citeshttps://doi.org/10.1007/978-1-4757-2807-1_4openalex-snapshot
An Annotated Bibliography for Post-Solution Analysis in Mixed Integer Programming and Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_325openalex-snapshot
Randomized Minimum Spanning Tree
inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_29openalex-snapshot
On Cartesian Trees and Range Minimum Queries
inferred← citeshttps://doi.org/10.1007/978-3-642-11409-0_16openalex-snapshot
An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-22300-6_25openalex-snapshot
Path Minima Queries in Dynamic Weighted Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_325-2openalex-snapshot
Randomized Minimum Spanning Tree
inferred← citeshttps://doi.org/10.1007/978-3-642-60744-8_26openalex-snapshot
Verifying Minimum Spanning Trees in Linear Time
inferred← citeshttps://doi.org/10.1007/bf02526037openalex-snapshot
A simpler minimum spanning tree verification algorithm
inferred← citeshttps://doi.org/10.1007/bf02579168openalex-snapshot
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
inferred← citeshttps://doi.org/10.1007/bfb0057736openalex-snapshot
Clustering techniques for minimizing object access time
inferred← citeshttps://doi.org/10.1007/s00224-004-1155-5openalex-snapshot
Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed Environment
inferred← citeshttps://doi.org/10.1007/s00224-013-9479-7openalex-snapshot
Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification
inferred← citeshttps://doi.org/10.1007/s00446-007-0025-1openalex-snapshot
Distributed verification of minimum spanning trees
inferred← citeshttps://doi.org/10.1007/s00453-012-9683-xopenalex-snapshot
On Cartesian Trees and Range Minimum Queries
inferred← citeshttps://doi.org/10.1007/s00453-016-0170-7openalex-snapshot
Succinct Indices for Path Minimum, with Applications
inferred← citeshttps://doi.org/10.1007/s00493-006-0014-1openalex-snapshot
An Inverse-Ackermann Type Lower Bound For Online Minimum Spanning Tree Verification*
inferred← citeshttps://doi.org/10.1016/0166-218x(91)90044-wopenalex-snapshot
Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems
inferred← citeshttps://doi.org/10.1016/j.cosrev.2008.10.002openalex-snapshot
The saga of minimum spanning trees
inferred← citeshttps://doi.org/10.1016/j.dam.2004.06.001openalex-snapshot
The algebraic Monge property and path problems
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00050-1openalex-snapshot
An optimal EREW PRAM algorithm for minimum spanning tree verification
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80064-9openalex-snapshot
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
inferred← citeshttps://doi.org/10.1103/physreve.81.021131openalex-snapshot
Theory of minimum spanning trees. II. Exact graphical methods and perturbation expansion at the percolation threshold
inferred← citeshttps://doi.org/10.1109/aiccsa.2005.1387013openalex-snapshot
Finding maximum-cost minimum spanning trees
inferred← citeshttps://doi.org/10.1109/icpads.1994.590315openalex-snapshot
Parallel algorithms for verification and sensitivity analysis of minimum spanning trees
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185419openalex-snapshot
Finding the hidden path: time bounds for all-pairs shortest paths
inferred← citeshttps://doi.org/10.1109/sfcs.2002.1181892openalex-snapshot
An inverse-Ackermann style lower bound for the online minimum spanning tree verification problem
inferred← citeshttps://doi.org/10.1109/tit.2006.871578openalex-snapshot
Verification of minimum-redundancy prefix codes
inferred← citeshttps://doi.org/10.1137/0221070openalex-snapshot
Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time
inferred← citeshttps://doi.org/10.1137/0222020openalex-snapshot
Optimal Randomized Algorithms for Local Sorting and Set-Maxima
inferred← citeshttps://doi.org/10.1137/0222071openalex-snapshot
Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths
inferred← citeshttps://doi.org/10.1137/0405001openalex-snapshot
A Linear Time Approach to the Set Maxima Problem
inferred← citeshttps://doi.org/10.1137/070693217openalex-snapshot
Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems
inferred← citeshttps://doi.org/10.1145/100216.100222openalex-snapshot
Optimal randomized algorithms for local sorting and set-maxima
inferred← citeshttps://doi.org/10.1145/1146381.1146389openalex-snapshot
Distributed verification of minimum spanning trees
inferred← citeshttps://doi.org/10.1145/1328911.1328916openalex-snapshot
Randomized minimum spanning tree algorithms using exponentially fewer random bits
inferred← citeshttps://doi.org/10.1145/1367064.1367071openalex-snapshot
Testing Euclidean minimum spanning trees in the plane
inferred← citeshttps://doi.org/10.1145/195058.195084openalex-snapshot
A randomized linear-time algorithm for finding minimum spanning trees
inferred← citeshttps://doi.org/10.1145/201019.201022openalex-snapshot
A randomized linear-time algorithm to find minimum spanning trees
inferred← citeshttps://doi.org/10.1145/276698.276764openalex-snapshot
Linear-time pointer-machine algorithms for least common ancestors, MST verification, and dominators
inferred← citeshttps://doi.org/10.1145/355541.355562openalex-snapshot
A minimum spanning tree algorithm with inverse-Ackermann type complexity
inferred← citeshttps://doi.org/10.33915/etd.312openalex-snapshot
On the Design, Analysis, and Implementation of Algorithms for Selected Problems in Graphs and Networks
inferred← citeshttps://doi.org/10.48550/arxiv.2105.01864openalex-snapshot
Tree Path Minimum Query Oracle via Boruvka Trees
inferred← citeshttps://doi.org/10.48550/arxiv.2107.14221openalex-snapshot
Can't See The Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter Spanners
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0207061openalex-snapshot
Linear-Time Pointer-Machine Algorithms for Path-Evaluation Problems on Trees and Graphs
inferred← citeshttps://doi.org/10.5555/314613.314770openalex-snapshot
Matroid decomposition methods for the set maxima problem
inferred← citeshttps://doi.org/10.5555/545381.545477openalex-snapshot
Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms
inferred← citeshttps://doi.org/10.5860/choice.42-1619aopenalex-snapshot
Spanning trees and optimization problems
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.