Abstract
In this paper we present the first dynamic data structure for testing – in constant time – the existence of two edge- or quasi-internally vertex-disjoint paths p 1 from s to t 1 and p 2 from s to t 2 for any three given vertices s,t 1, and t 2 of a digraph. By quasi-internally vertex-disjoint we mean that no inner vertex of p 1 appears on p 2 and vice versa. Moreover, for two vertices s and t, the data structure supports the output of all vertices and all edges whose removal would disconnect s and t in a time linear in the size of the output. The update operations consist of edge insertions and edge deletions, where the implementation of edge deletions will be given only in the full version of this paper. The update time after an edge deletion is competitive with the reconstruction of a static data structure for testing the existence of disjoint paths in constant time, whereas our data structure performs much better in the case of edge insertions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahuja, R.K., Goldberg, A.V., Orlin, J.B., Tarjan, R.E.: Finding minimum-cost flows by double scaling. Math. Programming, Series A 53, 243–266 (1992)
Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 88–94. Springer, Heidelberg (2000)
Demetrescu, C., Italiano, G.F.: Fully dynamic transitive closure: Breaking through the O(n 2) barrier. In: Proc. 41st Annual IEEE Symposium on Foundations of Computer Science (FOCS 2000), pp. 381–389 (2000)
Demetrescu, C., Italiano, G.F.: Fully dynamic all pairs shortest paths with real edge weights. In: Proc. 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2001), pp. 260–267 (2001)
Demetrescu, C., Italiano, G.F.: Improved bounds and new trade-offs for dynamic all pairs shortest paths. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 633–643. Springer, Heidelberg (2002)
Fortune, S., Hopcroft, J.E., Wyllie, J.: The directed subgraph homeomorphism problem. Theoretical Computer Science 10, 111–121 (1980)
Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM J. Comput. 13, 338–355 (1984)
Holm, J., de Lichtenberg, K., Thorup, M.: Poly-logarithmic deterministic fully dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. ACM 48, 723–760 (2001)
Lee, S.-W., Wu, C.-S.: A K-best paths algorithm for highly reliable communication networks. IEICE Trans. Commun. E82-B, 586–590 (1999)
King, V.: Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs. In: Proc. 40th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1999), pp. 81–89 (1999)
King, V., Thorup, M.: A space saving trick for directed dynamic transitive closure and shortest path algorithms. In: Wang, J. (ed.) COCOON 2001. LNCS, vol. 2108, pp. 268–277. Springer, Heidelberg (2001)
Suurballe, J.W., Tarjan, R.E.: A quick method for finding shortest pairs of disjoint paths. Networks 14, 325–336 (1984)
Thorup, M.: Near-optimal fully-dynamic graph connectivity. In: Proc. 32nd Annual ACM Symposium on Theory of Computing (STOC 2000), pp. 343–350 (2000)
Thorup, M.: Fully-dynamic min-cut. In: Proc. 33rd Annual ACM Symposium on Theory of Computing (STOC 2001), pp. 224–230 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tholey, T. (2003). A Dynamic Data Structure for Maintaining Disjoint Paths Information in Digraphs. In: Ibaraki, T., Katoh, N., Ono, H. (eds) Algorithms and Computation. ISAAC 2003. Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24587-2_58
Download citation
DOI: https://doi.org/10.1007/978-3-540-24587-2_58
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20695-8
Online ISBN: 978-3-540-24587-2
eBook Packages: Springer Book Archive