Khan, M., Pandurangan, G., & Anil Kumar, V. (2007). A simple randomized scheme for constructing low-weight k -connected spanning subgraphs with applications to distributed algorithms. Theoretical computer science, 385(1), 101-114. https://doi.org/10.1016/j.tcs.2007.05.028
Chicago-Zitierstil (17. Ausg.)Khan, Maleq, Gopal Pandurangan, und V.S Anil Kumar. "A Simple Randomized Scheme for Constructing Low-weight K -connected Spanning Subgraphs with Applications to Distributed Algorithms." Theoretical Computer Science 385, no. 1 (2007): 101-114. https://doi.org/10.1016/j.tcs.2007.05.028.
MLA-Zitierstil (9. Ausg.)Khan, Maleq, et al. "A Simple Randomized Scheme for Constructing Low-weight K -connected Spanning Subgraphs with Applications to Distributed Algorithms." Theoretical Computer Science, vol. 385, no. 1, 2007, pp. 101-114, https://doi.org/10.1016/j.tcs.2007.05.028.