Anastos, M., Diskin, S., Ignasiak, D., Lichev, L., & Sha, Y. (2025). Spanning trees of bounded degree in random geometric graphs.
Style de citation Chicago (17e éd.)Anastos, Michael, Sahar Diskin, Dawid Ignasiak, Lyuben Lichev, et Yetong Sha. Spanning Trees of Bounded Degree in Random Geometric Graphs. 2025.
Style de citation MLA (9e éd.)Anastos, Michael, et al. Spanning Trees of Bounded Degree in Random Geometric Graphs. 2025.
Attention : ces citations peuvent ne pas être correctes à 100%.