Computing strong articulation points and strong bridges in large scale graphs

Authors:
Donatella Firmani;Giuseppe F. Italiano;Luigi Laura;Alessio Orlandi;Federico Santaroni
Affiliations:
Dept. of Computer Science and Systems, Sapienza Univ. of Rome, Roma, Italy;Dept. of Computer Science, Systems and Production, Univ. of Rome "Tor Vergata", Roma, Italy;Dept. of Computer Science and Systems, Sapienza Univ. of Rome, Roma, Italy;Dept. of Computer Science, Univ. of Pisa, Pisa, Italy;Dept. of Computer Science, Systems and Production, Univ. of Rome "Tor Vergata", Roma, Italy
Venue:
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Year:
2012

Citing 11
Cited 1

Dominators in Linear Time

SIAM Journal on Computing
Graph structure in the Web

Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
A fast algorithm for finding dominators in a flowgraph

ACM Transactions on Programming Languages and Systems (TOPLAS)
Edge-disjoint spanning trees, dominators, and depth-first search.

Edge-disjoint spanning trees, dominators, and depth-first search.
The webgraph framework I: compression techniques

Proceedings of the 13th international conference on World Wide Web
Restricted arc-connectivity of digraphs

Information Processing Letters
Measurement and analysis of online social networks

Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Introduction to Algorithms, Third Edition

Introduction to Algorithms, Third Edition
Testing 2-vertex connectivity and computing pairs of vertex-disjoint s-t paths in digraphs

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
The tree constraint

CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Finding strong bridges and strong articulation points in linear time

Theoretical Computer Science

An experimental study of dynamic dominators

ESA'12 Proceedings of the 20th Annual European conference on Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let G=(V,E) be a directed graph. A vertex v∈V (respectively an edge e∈E) is a strong articulation point (respectively a strong bridge) if its removal increases the number of strongly connected components of G. We implement and engineer the linear-time algorithms in [9] for computing all the strong articulation points and all the strong bridges of a directed graph. Our implementations are tested against real-world graphs taken from several application domains, including social networks, communication graphs, web graphs, peer2peer networks and product co-purchase graphs. The algorithms implemented turn out to be very efficient in practice, and are able to run on large scale graphs, i.e., on graphs with ten million vertices and half billion edges. Our experiments on such graphs highlight some properties of strong articulation points, which might be of independent interest.