Shang, Yilun Long paths in heterogeneous random subgraphs of graphs with large minimum degree. (English) Zbl 07691959 Inf. Process. Lett. 182, Article ID 106401, 5 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{Y. Shang}, Inf. Process. Lett. 182, Article ID 106401, 5 p. (2023; Zbl 07691959) Full Text: DOI
Kundu, Sukhamay An optimal \(O(N^{2})\) algorithm for computing the min-transitive closure of a weighted graph. (English) Zbl 1339.05396 Inf. Process. Lett. 74, No. 5-6, 215-220 (2000). MSC: 05C85 68Q25 PDFBibTeX XMLCite \textit{S. Kundu}, Inf. Process. Lett. 74, No. 5--6, 215--220 (2000; Zbl 1339.05396) Full Text: DOI Link
Kim, Sung Kwon A note on finding compact sets in graphs represented by an adjacency list. (English) Zbl 0875.68701 Inf. Process. Lett. 57, No. 6, 335-338 (1996). MSC: 68R10 PDFBibTeX XMLCite \textit{S. K. Kim}, Inf. Process. Lett. 57, No. 6, 335--338 (1996; Zbl 0875.68701) Full Text: DOI
Dekel, Eliezer; Hu, Jie; Ouyang, Wen An optimal algorithm for finding compact sets. (English) Zbl 0768.68039 Inf. Process. Lett. 44, No. 5, 285-289 (1992). MSC: 68Q25 68R10 68R05 PDFBibTeX XMLCite \textit{E. Dekel} et al., Inf. Process. Lett. 44, No. 5, 285--289 (1992; Zbl 0768.68039) Full Text: DOI