"Efficient and near-optimal algorithms for sampling connected subgraphs."

Marco Bressan (2021)

> Home

Details and statistics

DOI: 10.1145/3406325.3451042

access: closed

type: Conference or Workshop Paper

metadata version: 2022-01-08

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/000221
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/000221
Marco Bressan:
Efficient and near-optimal algorithms for sampling connected subgraphs. STOC 2021: 1132-1143

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.