Strong Articulation Points and Strong Bridges in Large Scale Graphs
暂无分享,去创建一个
Giuseppe F. Italiano | Luigi Laura | Donatella Firmani | Federico Santaroni | Alessio Orlandi | G. Italiano | L. Laura | D. Firmani | Alessio Orlandi | Federico Santaroni
[1] Lutz Volkmann,et al. Restricted arc-connectivity of digraphs , 2007, Inf. Process. Lett..
[2] Loukas Georgiadis,et al. Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs , 2010, ICALP.
[3] Sebastiano Vigna,et al. The webgraph framework I: compression techniques , 2004, WWW '04.
[4] Robert E. Tarjan,et al. A fast algorithm for finding dominators in a flowgraph , 1979, TOPL.
[5] Ronald L. Rivest,et al. Introduction to Algorithms, third edition , 2009 .
[6] Laurence A. Wolsey,et al. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007, Proceedings , 2007, CPAIOR.
[7] Giuseppe F. Italiano,et al. Finding strong bridges and strong articulation points in linear time , 2012, Theor. Comput. Sci..
[8] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[9] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.
[10] R. Tarjan. Edge-disjoint spanning trees, dominators, and depth-first search. , 1974 .
[11] Xavier Lorca,et al. The tree Constraint , 2005, CPAIOR.
[12] Robert E. Tarjan,et al. Edge-disjoint spanning trees and depth-first search , 1976, Acta Informatica.
[13] Robert E. Tarjan,et al. A Linear-Time Algorithm for a Special Case of Disjoint Set Union , 1985, J. Comput. Syst. Sci..
[14] Andrei Z. Broder,et al. Graph structure in the Web , 2000, Comput. Networks.
[15] Mikkel Thorup,et al. Dominators in Linear Time , 1999, SIAM J. Comput..
[16] Krishna P. Gummadi,et al. Measurement and analysis of online social networks , 2007, IMC '07.