Author:
Sadri Hanieh,Srinivasan Venkatesh,Thomo Alex
Publisher
Springer Nature Switzerland
Reference29 articles.
1. Akiba, T., Iwata, Y., Yoshida, Y.: Linear-time enumeration of maximal k-edge-connected subgraphs in large networks by random contraction. In: CIKM, pp. 909–918 (2013)
2. Barabási, A.L., Oltvai, Z.N.: Network biology: understanding the cell’s functional organization. Nat. Rev. Genet. 5(2), 101–113 (2004)
3. Brin, S., Page, L.: Anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN Syst. 30(1–7), 107–117 (1998)
4. Chang, L., Wang, Z.: A near-optimal approach to edge connectivity-based hierarchical graph decomposition. VLDB J. 15, 1–23 (2023)
5. Chang, L., Yu, J.X., Qin, L., Lin, X., Liu, C., Liang, W.: Efficiently computing k-edge connected components via graph decomposition. In: SIGMOD, pp. 205–216 (2013)