"Near-Optimal and Practical Algorithms for Graph Scan Statistics with ..."

Jose Cadena, Feng Chen, Anil Vullikanti (2019)

> Home

Details and statistics

DOI: 10.1145/3309712

access: closed

type: Journal Article

metadata version: 2023-08-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tkdd/CadenaCV19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tkdd/CadenaCV19
Jose Cadena, Feng Chen, Anil Vullikanti:
Near-Optimal and Practical Algorithms for Graph Scan Statistics with Connectivity Constraints. ACM Trans. Knowl. Discov. Data 13(2): 20:1-20:33 (2019)

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.