Work-efficient parallel union-find
Copyright © 2017 John Wiley & Sons, Ltd. The incremental graph connectivity (IGC) problem is to maintain a data structure that can quickly answer whether two given vertices in a graph are connected, while allowing more edges to be added to the graph. IGC is a fundamental problem and can be sol...
Saved in:
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Published: |
2019
|
| Subjects: | |
| Online Access: | https://repository.li.mahidol.ac.th/handle/123456789/45649 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Mahidol University |