"A Lower Bound on Cycle-Finding in Sparse Digraphs."

Xi Chen et al. (2022)

> Home

Details and statistics

DOI: 10.1145/3417979

access: closed

type: Journal Article

metadata version: 2024-08-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/talg/ChenRSS22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/ChenRSS22
Xi Chen, Tim Randolph, Rocco A. Servedio, Timothy Sun:
A Lower Bound on Cycle-Finding in Sparse Digraphs. ACM Trans. Algorithms 18(4): 31:1-31:23 (2022)

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.