"GraphZeppelin: How to Find Connected Components (Even When Graphs Are ..."

David Tench et al. (2024)

> Home

Details and statistics

DOI: 10.1145/3643846

access: closed

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tods/TenchWZBCDDFSZ24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tods/TenchWZBCDDFSZ24
David Tench, Evan West, Victor Zhang, Michael A. Bender, Abiyaz Chowdhury, Daniel DeLayo, J. Ahmed Dellas, Martín Farach-Colton, Tyler Seip, Kenny Zhang:
GraphZeppelin: How to Find Connected Components (Even When Graphs Are Dense, Dynamic, and Massive). ACM Trans. Database Syst. 49(3): 9:1-9:31 (2024)

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.