Computing Strong Articulation Points and Strong Bridges in Large Scale Graphs

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 st...

Full description

Saved in:
Bibliographic Details
Published inExperimental Algorithms pp. 195 - 207
Main Authors Firmani, Donatella, Italiano, Giuseppe F., Laura, Luigi, Orlandi, Alessio, Santaroni, Federico
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2012
SeriesLecture Notes in Computer Science
Subjects
graph algorithms
large scale graphs
strong articulation points
strong bridges
strong connectivity
Online AccessGet full text

Cover

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.
AbstractList 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.
Author Laura, Luigi
Santaroni, Federico
Firmani, Donatella
Orlandi, Alessio
Italiano, Giuseppe F.
Author_xml – sequence: 1
  givenname: Donatella
  surname: Firmani
  fullname: Firmani, Donatella
  email: firmani@dis.uniroma1.it
  organization: Dept. of Computer Science and Systems, Sapienza Univ. of Rome, Roma, Italy
– sequence: 2
  givenname: Giuseppe F.
  surname: Italiano
  fullname: Italiano, Giuseppe F.
  email: italiano@disp.uniroma2.it
  organization: Dept. of Computer Science, Systems and Production, Univ. of Rome “Tor Vergata”, Roma, Italy
– sequence: 3
  givenname: Luigi
  surname: Laura
  fullname: Laura, Luigi
  email: laura@dis.uniroma1.it
  organization: Dept. of Computer Science and Systems, Sapienza Univ. of Rome, Roma, Italy
– sequence: 4
  givenname: Alessio
  surname: Orlandi
  fullname: Orlandi, Alessio
  email: aorlandi@di.unipi.it
  organization: Dept. of Computer Science, Univ. of Pisa, Pisa, Italy
– sequence: 5
  givenname: Federico
  surname: Santaroni
  fullname: Santaroni, Federico
  email: santaroni@disp.uniroma2.it
  organization: Dept. of Computer Science, Systems and Production, Univ. of Rome “Tor Vergata”, Roma, Italy
BookMark eNo1kN1OAjEQhatiIiBv4MW-QLXdabftJRJFkzWaoNdN6Q-uYku2y_tbEOfmZM6ZTE6-CRrFFD1CN5TcUkLEnRISA25YjYFITjDXVJ6hCRTnaMA5GtOGUgzA1AWalftTxpQaoTEBUmMlGFyhWc5fpExTVtWM0csi_ez2Qxc31WroU5F5P3R2vzVDl2L1lro45MpE9x_f953b-Fx1sWpNv_HVypqtr5a92X3ma3QZzDb72Umn6OPx4X3xhNvX5fNi3uJMKUgcglMBuLeBHFqZQBkwXntquDSS86Cs4cQwJUFY54Komasdt2a9tsJQAVNU__3Nu75U971ep_SdNSX6AEwXABp0QaCPfPQBGPwCV5lbkw
ContentType Book Chapter
Copyright Springer-Verlag Berlin Heidelberg 2012
Copyright_xml – notice: Springer-Verlag Berlin Heidelberg 2012
DOI 10.1007/978-3-642-30850-5_18
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 3642308503
9783642308505
EISSN 1611-3349
Editor Klasing, Ralf
Editor_xml – sequence: 1
  givenname: Ralf
  surname: Klasing
  fullname: Klasing, Ralf
  email: ralf.klasing@labri.fr
EndPage 207
GroupedDBID -DT
-GH
-~X
1SB
29L
2HA
2HV
5QI
875
AASHB
ABMNI
ACGFS
ADCXD
AEFIE
ALMA_UNASSIGNED_HOLDINGS
EJD
F5P
FEDTE
HVGLF
LAS
LDH
P2P
RIG
RNI
RSU
SVGTG
VI1
~02
ID FETCH-LOGICAL-s1138-ffd9f35ecf09743af143452e1a58a855f9ca50a49837cddf724d2d5cabbc7a173
ISBN 9783642308499
364230849X
ISSN 0302-9743
IngestDate Wed Nov 06 06:30:48 EST 2024
IsPeerReviewed true
IsScholarly true
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-s1138-ffd9f35ecf09743af143452e1a58a855f9ca50a49837cddf724d2d5cabbc7a173
Notes This work has been partially supported by the 7th Framework Programme of the EU (Network of Excellence “EuroNF: Anticipating the Network of the Future - From Theory to Design”) and by MIUR, the Italian Ministry of Education, University and Research, under Project AlgoDEEP.
PageCount 13
ParticipantIDs springer_books_10_1007_978_3_642_30850_5_18
PublicationCentury 2000
PublicationDate 2012
PublicationDateYYYYMMDD 2012-01-01
PublicationDate_xml – year: 2012
  text: 2012
PublicationDecade 2010
PublicationPlace Berlin, Heidelberg
PublicationPlace_xml – name: Berlin, Heidelberg
PublicationSeriesTitle Lecture Notes in Computer Science
PublicationSubtitle 11th International Symposium, SEA 2012, Bordeaux, France, June 7-9, 2012. Proceedings
PublicationTitle Experimental Algorithms
PublicationYear 2012
Publisher Springer Berlin Heidelberg
Publisher_xml – name: Springer Berlin Heidelberg
RelatedPersons Kleinberg, Jon M.
Mattern, Friedemann
Nierstrasz, Oscar
Steffen, Bernhard
Kittler, Josef
Vardi, Moshe Y.
Weikum, Gerhard
Sudan, Madhu
Naor, Moni
Mitchell, John C.
Terzopoulos, Demetri
Pandu Rangan, C.
Kanade, Takeo
Hutchison, David
Tygar, Doug
RelatedPersons_xml – sequence: 1
  givenname: David
  surname: Hutchison
  fullname: Hutchison, David
  organization: Lancaster University, Lancaster, UK
– sequence: 2
  givenname: Takeo
  surname: Kanade
  fullname: Kanade, Takeo
  organization: Carnegie Mellon University, Pittsburgh, USA
– sequence: 3
  givenname: Josef
  surname: Kittler
  fullname: Kittler, Josef
  organization: University of Surrey, Guildford, UK
– sequence: 4
  givenname: Jon M.
  surname: Kleinberg
  fullname: Kleinberg, Jon M.
  organization: Cornell University, Ithaca, USA
– sequence: 5
  givenname: Friedemann
  surname: Mattern
  fullname: Mattern, Friedemann
  organization: ETH Zurich, Zurich, Switzerland
– sequence: 6
  givenname: John C.
  surname: Mitchell
  fullname: Mitchell, John C.
  organization: Stanford University, Stanford, USA
– sequence: 7
  givenname: Moni
  surname: Naor
  fullname: Naor, Moni
  organization: Weizmann Institute of Science, Rehovot, Israel
– sequence: 8
  givenname: Oscar
  surname: Nierstrasz
  fullname: Nierstrasz, Oscar
  organization: University of Bern, Bern, Switzerland
– sequence: 9
  givenname: C.
  surname: Pandu Rangan
  fullname: Pandu Rangan, C.
  organization: Indian Institute of Technology, Madras, India
– sequence: 10
  givenname: Bernhard
  surname: Steffen
  fullname: Steffen, Bernhard
  organization: University of Dortmund, Dortmund, Germany
– sequence: 11
  givenname: Madhu
  surname: Sudan
  fullname: Sudan, Madhu
  organization: Massachusetts Institute of Technology, USA
– sequence: 12
  givenname: Demetri
  surname: Terzopoulos
  fullname: Terzopoulos, Demetri
  organization: University of California, Los Angeles, USA
– sequence: 13
  givenname: Doug
  surname: Tygar
  fullname: Tygar, Doug
  organization: University of California, Berkeley, USA
– sequence: 14
  givenname: Moshe Y.
  surname: Vardi
  fullname: Vardi, Moshe Y.
  organization: Rice University, Houston, USA
– sequence: 15
  givenname: Gerhard
  surname: Weikum
  fullname: Weikum, Gerhard
  organization: Max-Planck Institute of Computer Science, Saarbrücken, Germany
SSID ssj0000697496
ssj0002792
Score 1.7851127
Snippet 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...
SourceID springer
SourceType Publisher
StartPage 195
SubjectTerms graph algorithms
large scale graphs
strong articulation points
strong bridges
strong connectivity
Title Computing Strong Articulation Points and Strong Bridges in Large Scale Graphs
URI http://link.springer.com/10.1007/978-3-642-30850-5_18
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lb5wwELY26aXqoelLfSSVD70hogXjxRx62EZ5KNpEPSRVbsiASZFSNtqFS35HfnBnPDZLm6hSelntAlpgPjMexvN9w9iXutASl9fgSRNVmEDMHKosjeFVBeKJSohSTZEofHY-O7lMTq_k1WRyP6pa6rtiv7x7lFfyP6jCNsAVWbJPQHb4U9gA3wFf-ASE4fOv4PfPNKuvntto889vrpfwmv_z14bO0SAdgGjkmCE31F2IxkFnsxs2S3rc9Gtze2uCo_2hOEf3tvtQsOib62ZIw1pacONYMVg8Ox5u1B2C5L1X2L9ovrKyHjS-vi8bLLexZaK0-5uTl2jaYIHF6OBkYKoKjlE_m-4BLWjWXxdukeN82dHhvg-Fd0vjvIUtABnnLXzeMviHrJelmEC8N1UJdVHyTC_w4vAeRI7RkOOeoRyjIPlT54wjat_p5vWYuus-mDLGVSJwslCgiF8o80htsa00A6_5bH54uvgxZO6mMzg3ihS6-R4lGGmtiq4KGUT-qp3G0-YuRuzNx075YD3ehjkXO-wFUl84clLAwK_YxLSv2UtvcO4M_oadDWhzgpOP0eaENge0_W6HNm9abtHmFm1OaL9ll0eHFwcnoevLEa6jCObHuq6yWkhT1lO8X11DzJ3I2ERaKq2krDPss6GTTIm0rKo6jZMqrmSpi6JMdZSKd2y7XbbmPeOlkmUFPkHFKMRoNMzNpojrysxi-FGmH1jg7ZHjk7bOvcw2WC8XOVgvt9bL0Xofn3T0J_Z8My532Xa36s0eRJhd8dlB_hu6I3OK
link.rule.ids 782,783,787,796,27937
linkProvider Library Specific Holdings
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.title=Experimental+Algorithms&rft.au=Firmani%2C+Donatella&rft.au=Italiano%2C+Giuseppe+F.&rft.au=Laura%2C+Luigi&rft.au=Orlandi%2C+Alessio&rft.atitle=Computing+Strong+Articulation+Points+and+Strong+Bridges+in+Large+Scale+Graphs&rft.series=Lecture+Notes+in+Computer+Science&rft.date=2012-01-01&rft.pub=Springer+Berlin+Heidelberg&rft.isbn=9783642308499&rft.issn=0302-9743&rft.eissn=1611-3349&rft.spage=195&rft.epage=207&rft_id=info:doi/10.1007%2F978-3-642-30850-5_18
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0302-9743&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0302-9743&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0302-9743&client=summon