Abstract
In several applications it is necessary to deal with data structures that may dinamically change during a sequence of operations. In these cases the classical worst case analysis of the cost of a single operation may not adequately describe the behaviour of the structure but it is rather more meaningful to analyze the cost of the whole sequence of operations. In this paper we first discuss some results on maintaining paths in dynamic graphs. Besides, we consider paths problems on dynamic labeled graphs and we show how to maintain path expressions in the acyclic case when insertions of new arcs are allowed.
Extended abstract
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
G. Ausiello, A. D'Atri, D. Saccà, Minimal representation of directed hypergraphs, Journal ACM, 15,2,1986
G. Ausiello, G.F. Italiano, On line algorithms for polynomially solvable satisfiability problems, Technical Rep. DIS, 1987
G. Ausiello, G.F. Italiano, U. Nanni, Directed hypergraphs. Data structures and applications, to appear Theoretical Computer Sci., 1988
M.R.Brown, R. Tarjan, Design and analysis of a data structure for representing sorted lists, SIAM J. Comput., 9, 1980
D.Coppersmith, S.Winograd, Matrix multiplication via arithmetic progression, Proc. XIX ACM STOC, New York, 1987
S.Even, H. Gazit, Updating distances in dynamic graphs, Meth. of Op. Res., 49, 1985
S.Even, Y.Shiloach, An on-line edge deletion problem, Journal ACM, 28, 1981
F.Frederickson, Data Structures for On-line Updating of Minimum Spanning Trees with Applications, SIAM J. on Computing, vol. 14, 1985
S. Huddleston, K. Mehlhorn, A new data structure for representing sorted lists, Acta Inform., 17, 1982
T. Ibaraki, N. Katoh, On-line computation of transitive closure for graphs, Information Processing letters, 16, 1983
G.F. Italiano, Amortized efficiency of a path retrieval data structure, Theoretical Computer Sci., 48, 1986
J.A. La Poutré, J. van Leeuwen, Maintenance of transitive closures and transitive reductions of graphs, manuscript.
H.Rohnert, A Dynamization of the All-Pairs Least Cost Problem, Proc. Symp. Theory and Applications of Computer Sci., Lect. Notes in Computer Sci., Springer-Verlag, 1985.
R.E. Tarjan, On the efficiency of a good but not linear set merging algorithm, Journal ACM, 22,2, 1975
R.E. Tarjan, A unified approach to path problems, Journal ACM, 28,3, 1981
R.E. Tarjan, Fast algorithms for solving path problems, Journal ACM, 28,3, 1985
R.E. Tarjan, Amortized computational complexity, Siam J. Alg. Disc. Meth., 6,2, 1985
R.E. Tarjan, Algorithm design, Comm. ACM, 30,3, 1987
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ausiello, G., Spaccamela, A.M., Nanni, U. (1989). Dynamic maintenance of paths and path expressions on graphs. In: Gianni, P. (eds) Symbolic and Algebraic Computation. ISSAC 1988. Lecture Notes in Computer Science, vol 358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51084-2_1
Download citation
DOI: https://doi.org/10.1007/3-540-51084-2_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51084-0
Online ISBN: 978-3-540-46153-1
eBook Packages: Springer Book Archive