论文信息 - Amortized Efficiency of a Path Retrieval Data Structure

Amortized Efficiency of a Path Retrieval Data Structure

A data structure is presented for the problem of maintaining a digraph under an arbitrary sequence of two kinds of operations: an Add operation that inserts an arc in the digraph, and a Searchpath operation that checks the presence of a path between a pair of nodes. Our data structure supports both operations in O(n) amortized time and requires O(n2) space, where n is the number of nodes in the digraph.

Giuseppe F. Italiano | G. Italiano

[1] Toshihide Ibaraki,et al. On-Line Computation of Transitive Closures of Graphs , 1983, Inf. Process. Lett..

[2] Robert E. Tarjan,et al. Amortized efficiency of list update rules , 1984, STOC '84.

[3] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[4] Hans Rohnert,et al. A Dynamization of the All Pairs Least Cost Path Problem , 1985, STACS.

[5] R. Tarjan. Amortized Computational Complexity , 1985 .

[6] Giorgio Ausiello,et al. Minimal Representation of Directed Hypergraphs , 1986, SIAM J. Comput..

[7] Greg N. Frederickson,et al. Data structures for on-line updating of minimum spanning trees , 1983, STOC.

[8] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[9] Shimon Even,et al. An On-Line Edge-Deletion Problem , 1981, JACM.

[10] Frank Harary,et al. Graph Theory , 2016 .

[11] Jan van Leeuwen,et al. Worst-case Analysis of Set Union Algorithms , 1984, JACM.