Chalermsook, P., Kaul, M., Mnich, M., Spoerhase, J., Uniyal, S., & Vaz, D. (2021). Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter.
Citazione stile Chigago Style (17a edizione)Chalermsook, Parinya, Matthias Kaul, Matthias Mnich, Joachim Spoerhase, Sumedha Uniyal, e Daniel Vaz. Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter. 2021.
Citatione MLA (9a ed.)Chalermsook, Parinya, et al. Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter. 2021.
Attenzione: Queste citazioni potrebbero non essere precise al 100%.