Loukas Georgiadis
Giuseppe F. Italiano
Abstract
Edge and vertex connectivity are fundamental concepts in graph theory. While they have been thoroughly studied in the case of undirected graphs, surprisingly, not much has been investigated for directed graphs. In this article, we study 2-edge connectivity problems in directed graphs and, in particular, we consider the computation of the following natural relation: We say that two vertices v and w are 2-edge-connected if there are two edge-disjoint paths from v to w and two edge-disjoint paths from w to v. This relation partitions the vertices into blocks such that all vertices in the same block are 2-edge-connected. Differently from the undirected case, those blocks do not correspond to the 2-edge-connected components of the graph. The main result of this article is an algorithm for computing the 2-edge-connected blocks of a directed graph in linear time. Besides being asymptotically optimal, our algorithm improves significantly over previous bounds. Once the 2-edge-connected blocks are available, we can test in constant time if two vertices are 2-edge-connected. Additionally, when two query vertices v and w are not 2-edge-connected, we can produce in constant time a “witness” of this property by exhibiting an edge that is contained in all paths from v to w or in all paths from w to v. We are also able to compute in linear time a sparse certificate for this relation, i.e., a subgraph of the input graph that has O(n) edges and maintains the same 2-edge-connected blocks as the input graph, where n is the number of vertices.
- S. Alstrup, D. Harel, P. W. Lauridsen, and M. Thorup. 1999. Dominators in linear time. SIAM J. Comput. 28, 6 (1999), 2117--32. Google Scholar
Digital Library
- J. Bang-Jensen and G. Gutin. 2002. Digraphs: Theory, Algorithms and Applications (Springer Monographs in Mathematics) (1st ed. 2001. 3rd printing ed.). Springer.Google ScholarCross Ref
- A. L. Buchsbaum, L. Georgiadis, H. Kaplan, A. Rogers, R. E. Tarjan, and J. R. Westbrook. 2008. Linear-time algorithms for dominators and other path-evaluation problems. SIAM J. Comput. 38, 4 (2008), 1533--1573. Google ScholarDigital Library
- A. L. Buchsbaum, H. Kaplan, A. Rogers, and J. R. Westbrook. 1998. A new, simpler linear-time dominators algorithm. ACM Transactions on Programming Languages and Systems 20, 6 (1998), 1265--96. Corrigendum in 27(3):383-7, 2005. Google ScholarDigital Library
- T. H. Cormen, C. E. Leiserson, and R. L. Rivest. 1991. Introduction to Algorithms. MIT Press, Cambridge, MA. Google ScholarDigital Library
- W. Di Luigi, L. Georgiadis, G. F. Italiano, L. Laura, and N. Parotsidis. 2015. 2-connectivity in directed graphs: An experimental study. In Proceedings of the 17th Workshop on Algorithm Engineering and Experiments. 173--187. DOI:http://dx.doi.org/10.1137/1.9781611973754.15 Google ScholarDigital Library
- Ya. M. Erusalimskii and G. G. Svetlov. 1980. Bijoin points, bibridges, and biblocks of directed graphs. Cybernetics 16, 1 (1980), 41--44. DOI:http://dx.doi.org/10.1007/BF01099359 Google ScholarCross Ref
- D. Firmani, G. F. Italiano, L. Laura, A. Orlandi, and F. Santaroni. 2012. Computing strong articulation points and strong bridges in large scale graphs. In Proceedings of the 10th International Symposium on Experimental Algorithms. 195--207. Google ScholarDigital Library
- D. R. Ford and D. R. Fulkerson. 2010. Flows in Networks. Princeton University Press, Princeton, NJ. Google ScholarDigital Library
- W. Fraczak, L. Georgiadis, A. Miller, and R. E. Tarjan. 2013. Finding dominators via disjoint set union. Journal of Discrete Algorithms 23, 2--20. DOI:http://dx.doi.org/10.1016/j.jda.2013.10.003 Google ScholarDigital Library
- H. N. Gabow. 2016. The minset-poset approach to representations of graph connectivity. ACM Transactions on Algorithms 12, 2, Article 24, 73 pages. DOI:http://dx.doi.org/10.1145/2764909 Google ScholarDigital Library
- H. N. Gabow and R. E. Tarjan. 1985. A linear-time algorithm for a special case of disjoint set union. J. Comput. System Sci. 30, 2 (1985), 209--21. Google ScholarCross Ref
- M. R. Garey and D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman 8 Co., New York, NY. Google ScholarDigital Library
- L. Georgiadis, G. F. Italiano, L. Laura, and N. Parotsidis. 2015a. 2-vertex connectivity in directed graphs. In Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming. 605--616. Google ScholarCross Ref
- L. Georgiadis, G. F. Italiano, C. Papadopoulos, and N. Parotsidis. 2015b. Approximating the smallest spanning subgraph for 2-edge-connectivity in directed graphs. In Proceedings of the 23rd European Symposium on Algorithms. 582--594. Google ScholarCross Ref
- L. Georgiadis, L. Laura, N. Parotsidis, and R. E. Tarjan. 2014. Loop nesting forests, dominators, and applications. In Proceedings of the 13th International Symposium on Experimental Algorithms. 174--186. Google ScholarDigital Library
- L. Georgiadis and R. E. Tarjan. 2004. Finding dominators revisited. In Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms. 862--871. Google ScholarDigital Library
- L. Georgiadis and R. E. Tarjan. 2015. Dominator tree certification and divergent spanning trees. ACM Transactions on Algorithms 12, 1, Article 11, 42 pages. DOI:http://dx.doi.org/10.1145/2764913 Google ScholarDigital Library
- Y. Guo, F. Kuipers, and P. Van Mieghem. 2003. Link-disjoint paths for reliable QoS routing. International Journal of Communication Systems 16, 9 (2003), 779--798. DOI:http://dx.doi.org/10.1002/dac.612 Google ScholarCross Ref
- M. Henzinger, S. Krinninger, and V. Loitzenbauer. 2015. Finding 2-edge and 2-vertex strongly connected components in quadratic time. In Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming. 713--724. Google ScholarCross Ref
- A. Itai and M. Rodeh. 1988. The multi-tree approach to reliability in distributed networks. Information and Computation 79, 1, 43--59. Google ScholarDigital Library
- G. F. Italiano, L. Laura, and F. Santaroni. 2012. Finding strong bridges and strong articulation points in linear time. Theoretical Computer Science 447, 74--84. DOI:http://dx.doi.org/10.1016/j.tcs.2011.11.011 Google ScholarDigital Library
- R. Jaberi. 2015. Computing the 2-blocks of directed graphs. RAIRO-Theor. Inf. Appl. 49, 2 (2015), 93--119. DOI:http://dx.doi.org/10.1051/ita/2015001 Google ScholarCross Ref
- R. Jaberi. 2016. On computing the 2-vertex-connected components of directed graphs. Discrete Applied Mathematics 204, 164--172. DOI:http://dx.doi.org/10.1016/j.dam.2015.10.001 Google ScholarDigital Library
- T. Lengauer and R. E. Tarjan. 1979. A fast algorithm for finding dominators in a flowgraph. ACM Transactions on Programming Languages and Systems 1, 1, 121--41. Google ScholarDigital Library
- K. Menger. 1927. Zur allgemeinen kurventheorie. Fund. Math. 10, 96--115.Google ScholarCross Ref
- H. Nagamochi and T. Ibaraki. 1992. A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph. Algorithmica 7, 583--596. Google ScholarCross Ref
- H. Nagamochi and T. Ibaraki. 2008. Algorithmic Aspects of Graph Connectivity, 1st ed. Cambridge University Press. Google ScholarDigital Library
- H. Nagamochi and T. Watanabe. 1993. Computing k-edge-connected components of a multigraph. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E76A, 4, 513--517.Google Scholar
- R. E. Tarjan. 1972. Depth-first search and linear graph algorithms. SIAM J. Comput. 1, 2, 146--160. Google ScholarDigital Library
- R. E. Tarjan. 1974a. Edge-Disjoint Spanning Trees, Dominators, and Depth-First Search. Technical Report. Stanford University, Stanford, CA. Google Scholar
- R. E. Tarjan. 1974b. Finding dominators in directed graphs. SIAM J. Comput. 3, 1, 62--89. Google ScholarDigital Library
- R. E. Tarjan. 1975. Efficiency of a good but not linear set union algorithm. J. ACM 22, 2, 215--225. Google ScholarDigital Library
- R. E. Tarjan. 1976. Edge-disjoint spanning trees and depth-first search. Acta Informatica 6, 2, 171--85. Google ScholarDigital Library
Index Terms
- 2-Edge Connectivity in Directed Graphs
Recommendations
2-vertex connectivity in directed graphs
AbstractGiven a directed graph, two vertices v and w are 2-vertex-connected if there are two internally vertex-disjoint paths from v to w and two internally vertex-disjoint paths from w to v. In this paper, we show how to compute this relation ...
On the connectivity and restricted edge-connectivity of 3-arc graphs
Let G denote the symmetric digraph of a graph G . A 3-arc is a 4-tuple ( y , a , b , x ) of vertices such that both ( y , a , b ) and ( a , b , x ) are paths of length 2 in G . The 3-arc graph X ( G ) of a given graph G is defined to have vertices the ...
On the 3-restricted edge connectivity of permutation graphs
An edge cut W of a connected graph G is a k-restricted edge cut if G-W is disconnected, and every component of G-W has at least k vertices. The k-restricted edge connectivity is defined as the minimum cardinality over all k-restricted edge cuts. A ...
Comments