Bernstein, Aaron; Gutenberg, Maximilian Probst; Wulff-Nilsen, Christian Decremental strongly connected components and single-source reachability in near-linear time. (English) Zbl 1479.05296 SIAM J. Comput. 50, No. 5, STOC19-128-STOC19-155 (2021). MSC: 05C70 05C40 05C85 68P05 68W40 68W20 05C20 PDFBibTeX XMLCite \textit{A. Bernstein} et al., SIAM J. Comput. 50, No. 5, STOC19--128-STOC19--155 (2021; Zbl 1479.05296) Full Text: DOI
Georgiadis, Loukas; Italiano, Giuseppe F.; Parotsidis, Nikos Strong connectivity in directed graphs under failures, with applications. (English) Zbl 1448.05116 SIAM J. Comput. 49, No. 5, 865-926 (2020). Reviewer: Yilun Shang (Newcastle) MSC: 05C40 05C20 05C85 PDFBibTeX XMLCite \textit{L. Georgiadis} et al., SIAM J. Comput. 49, No. 5, 865--926 (2020; Zbl 1448.05116) Full Text: DOI
Roditty, Liam; Zwick, Uri Improved dynamic reachability algorithms for directed graphs. (English) Zbl 1225.68276 SIAM J. Comput. 37, No. 5, 1455-1471 (2008). MSC: 68W40 68W20 68W05 68Q25 PDFBibTeX XMLCite \textit{L. Roditty} and \textit{U. Zwick}, SIAM J. Comput. 37, No. 5, 1455--1471 (2008; Zbl 1225.68276) Full Text: DOI Link
Chen, Guantao; Gao, Zhicheng; Yu, Xingxing; Zang, Wenan Approximating longest cycles in graphs with bounded degrees. (English) Zbl 1118.05047 SIAM J. Comput. 36, No. 3, 635-656 (2006). MSC: 05C38 68R10 05C85 PDFBibTeX XMLCite \textit{G. Chen} et al., SIAM J. Comput. 36, No. 3, 635--656 (2006; Zbl 1118.05047) Full Text: DOI
Chen, Guantao; Xu, Jun; Yu, Xingxing Circumference of graphs with bounded degree. (English) Zbl 1055.05089 SIAM J. Comput. 33, No. 5, 1136-1170 (2004). MSC: 05C38 05C45 05C85 68R10 PDFBibTeX XMLCite \textit{G. Chen} et al., SIAM J. Comput. 33, No. 5, 1136--1170 (2004; Zbl 1055.05089) Full Text: DOI
Karger, David R.; Nisan, Noam; Parnas, Michal Fast connected components algorithms for the EREW PRAM. (English) Zbl 0918.68042 SIAM J. Comput. 28, No. 3, 1021-1034 (1999). MSC: 68W15 68R10 05C40 05C85 60G50 68Q25 PDFBibTeX XMLCite \textit{D. R. Karger} et al., SIAM J. Comput. 28, No. 3, 1021--1034 (1999; Zbl 0918.68042) Full Text: DOI
Kao, Ming-Yang Linear-processor NC algorithms for planar directed graphs. I: Strongly connected components. (English) Zbl 0773.68040 SIAM J. Comput. 22, No. 3, 431-459 (1993). MSC: 68Q25 68W15 68R10 05C99 PDFBibTeX XMLCite \textit{M.-Y. Kao}, SIAM J. Comput. 22, No. 3, 431--459 (1993; Zbl 0773.68040) Full Text: DOI
Gazit, Hillel An optimal randomized parallel algorithm for finding connected components in a graph. (English) Zbl 0738.68062 SIAM J. Comput. 20, No. 6, 1046-1067 (1991). MSC: 68R10 68Q25 05C38 05C40 68Q10 PDFBibTeX XMLCite \textit{H. Gazit}, SIAM J. Comput. 20, No. 6, 1046--1067 (1991; Zbl 0738.68062) Full Text: DOI
Frederickson, Greg N. Data structures for on-line updating of minimum spanning trees, with applications. (English) Zbl 0575.68068 SIAM J. Comput. 14, 781-798 (1985). MSC: 68R10 PDFBibTeX XMLCite \textit{G. N. Frederickson}, SIAM J. Comput. 14, 781--798 (1985; Zbl 0575.68068) Full Text: DOI Link
Tsin, Yung H.; Chin, Francis Y. Efficient parallel algorithms for a class of graph theoretic problems. (English) Zbl 0545.68060 SIAM J. Comput. 13, 580-599 (1984). MSC: 68R10 68Q25 PDFBibTeX XMLCite \textit{Y. H. Tsin} and \textit{F. Y. Chin}, SIAM J. Comput. 13, 580--599 (1984; Zbl 0545.68060) Full Text: DOI Link
Hambrusch, Susanne E. VLSI algorithms for the connected component problem. (English) Zbl 0512.68047 SIAM J. Comput. 12, 354-365 (1983). MSC: 68R10 68Q25 PDFBibTeX XMLCite \textit{S. E. Hambrusch}, SIAM J. Comput. 12, 354--365 (1983; Zbl 0512.68047) Full Text: DOI
Nassimi, David; Sahni, Sartaj Finding connected components and connected ones on a mesh-connected parallel computer. (English) Zbl 0447.68070 SIAM J. Comput. 9, 744-757 (1980). MSC: 68R10 05C40 68Q25 68N99 PDFBibTeX XMLCite \textit{D. Nassimi} and \textit{S. Sahni}, SIAM J. Comput. 9, 744--757 (1980; Zbl 0447.68070) Full Text: DOI