"Optimal stopping for many connected components in a graph."

Michal Lason (2021)

> Home

Details and statistics

DOI: 10.1002/RSA.21000

access: closed

type: Journal Article

metadata version: 2024-02-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/rsa/Lason21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/Lason21
Michal Lason:
Optimal stopping for many connected components in a graph. Random Struct. Algorithms 59(2): 267-287 (2021)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.