Cite
HARVARD Citation
Lasoń, M. (2021). Optimal stopping for many connected components in a graph. Random structures & algorithms. 59 (2), pp. 267-287. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Lasoń, M. (2021). Optimal stopping for many connected components in a graph. Random structures & algorithms. 59 (2), pp. 267-287. [Online].