Abstract
We give incremental algorithms, which support both edge insertions and deletions, for the all-pairs shortest-distance problem (APSD) in weighted undirected graphs. Our algorithms use first-order queries, + (addition) and < (less-than); they store O(n2) number of tuples, where n is the number of vertices, and have AC0 data complexity for integer weights. Since FO(+,
Cite
CITATION STYLE
APA
Pang, C., Kotagiri, R., & Dong, G. (1998). Incremental FO(+,. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1540, pp. 365–382). Springer Verlag. https://doi.org/10.1007/3-540-49257-7_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free