ConnectIt: a framework for static and incremental parallel graph connectivity algorithms
© VLDB Endowment. All rights reserved. Connected components is a fundamental kernel in graph applications. The fastest existing multicore algorithms for solving graph connectivity are based on some form of edge sampling and/or linking and compressing trees. However, many combinations of these design...
Main Authors: | , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
VLDB Endowment
2021
|
Online Access: | https://hdl.handle.net/1721.1/133950 |