Huber, M. K. (2024). How quickly can you pack short paths? Engineering a search-tree algorithm for disjoint s-t paths of bounded length.
Style de citation Chicago (17e éd.)Huber, Michael Kiran. How Quickly Can You Pack Short Paths? Engineering a Search-tree Algorithm for Disjoint S-t Paths of Bounded Length. 2024.
Style de citation MLA (9e éd.)Huber, Michael Kiran. How Quickly Can You Pack Short Paths? Engineering a Search-tree Algorithm for Disjoint S-t Paths of Bounded Length. 2024.
Attention : ces citations peuvent ne pas être correctes à 100%.