An inverse-Ackermann style lower bound for the online minimum spanning tree verification problem

  title={An inverse-Ackermann style lower bound for the online minimum spanning tree verification problem},
  author={Seth Pettie},
  journal={The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.},
  • Seth Pettie
  • Published 16 November 2002
  • Computer Science
  • The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
We consider the problem of preprocessing an edge-weighted tree T in order to quickly answer queries of the following type: does a given edge e belong in the minimum spanning tree of T /spl cup/ {e}? Whereas the offline minimum spanning tree verification problem admits a lovely linear time solution, we demonstrate an inherent inverse-Ackermann type tradeoff in the online MST verification problem. In particular, any scheme that answers queries in t comparisons must invest /spl Omega/(n log /spl… 

Figures from this paper

A Shortest Path Algorithm for Real-Weighted Undirected Graphs
The algorithm takes the hierarchy-based approach invented by Thorup, and, if the ratio between the maximum and minimum edge lengths is bounded by n(log n)O(1), it can solve the single-source problem in O(m + n log log n) time.
Efficient data structures for range-aggregate queries on trees
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree) but the solutions rely on additive inverses for the "+" operator, and they fail for the MIN aggregation which is the topic of this paper.
A new approach to all-pairs shortest paths on real-weighted graphs
  • Seth Pettie
  • Computer Science, Mathematics
    Theor. Comput. Sci.
  • 2004
On Cartesian Trees and Range Minimum Queries
A cache-oblivious Cartesian Tree for solving the range minimum query problem, a Cartesian tree for the bottleneck edge query problem on trees and undirected graphs, and a proof that no Cartesian trees exists for the two-dimensional version of the rangeminimum query problem are introduced.
Параллельная реализация алгоритма поиска минимальных остовных деревьев с использованием центрального и графического процессоров
The methods of compression and conversion of graphs in standard formats to increase the efficiency of their processing are described and a hybrid implementation of this algorithm has been investigated.


Applications of Path Compression on Balanced Trees
A method for computing functions defined on paths in trees based on tree manipulation techniques first used for efficiently representing equivalence relations, which has an almost-linear running time and is useful for solving certain kinds of pathfinding problems on reducible graphs.
Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time
This paper describes a linear-time algorithm for verifying a minimum spanning tree and combines the result of Komlos with a preprocessing and table look-up method for small subproblems and with a previously known almost-linear- time algorithm.
All sequential preprocessing algorithms can be parallelized efficiently to givimal parallel algorithms which run in O (logn ) time on a CREW PRAM, which are optimal in both running time and total number of operations.
On the Comparison-Addition Complexity of All-Pairs Shortest Paths
The alorithm e1iminates the sorting bottleneck inherent in approaches based on Dijkstra's alogrithm, and for graphs with O(n) edges and within a tiny O(log ?) factor of optimal.
Space-time tradeoff for answering range queries (Extended Abstract)
  • A. Yao
  • Computer Science
    STOC '82
  • 1982
This paper raises and investigates the question of (storage) space- (retrieval) time tradeoff for a static database, in the general framework of Fredman's, and proves that, for the interval query, any algorithm to process a sequence of 0(n) INSERT and QUERY instructions must take time -&-Ohgr;((n log n)/(log log n)) in the worst case.
Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms
This work considers the problem of selection and proposes new algorithms for these problems which preserve optimality while saving an exponential number of random bits, in the case of computing minimum spanning trees and MST/SSSP sensitivity analysis.
An optimal minimum spanning tree algorithm
It is established that the algorithmic complexity of the minimumspanning tree problem is equal to its decision-tree complexity and a deterministic algorithm to find aminimum spanning tree of a graph with vertices and edges that runs in time is presented.
Lower bounds for the union-find and the split-find problem on pointer machines
It is proved that this bound holds on a general pointer machine without the separation condition and that the same bound holds for the Split Find problem as well.
A Lower Bound on the Complexity of Orthogonal Range Queries
It is shown here that fi(n(logn) ~) is a lower bound on the inherent worst case time reqmred to process a sequence of n intermixed insemons, deleuons, and range queries, which imphes that the Lueker and Wdlard data structures are in some sense optimal.
A scaling algorithm for weighted matching on general graphs
  • H. Gabow
  • Computer Science
    26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
  • 1985
An algorithm for maximum matching on general graphs with integral edge weights, running in time O(n3/4m lg N), where n, m and N are the number of vertices, number of edges, and largest edge weight magnitude, respectively.