Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs."

Marco Bressan (2023)

> Home

Details and statistics

DOI: 10.1145/3596495

access: closed

type: Journal Article

metadata version: 2023-08-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/talg/Bressan23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/Bressan23
Marco Bressan:
Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs. ACM Trans. Algorithms 19(3): 26:1-26:40 (2023)

a service of

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.