"New polynomial delay bounds for maximal subgraph enumeration by proximity ..."

Alessio Conte, Takeaki Uno (2019)

> Home

Details and statistics

DOI: 10.1145/3313276.3316402

access: closed

type: Conference or Workshop Paper

metadata version: 2019-06-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/ConteU19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/ConteU19
Alessio Conte, Takeaki Uno:
New polynomial delay bounds for maximal subgraph enumeration by proximity search. STOC 2019: 1179-1190

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.