GPU-Based Graph Decomposition into Strongly Connected and Maximal End Components
Abstract elided by the publisher.
Related papers
- INTERLEAVE: A Faster Symbolic Algorithm for Maximal End Component Decomposition CAV 2025
- Symbolic Coloured SCC Decomposition TACAS 2021
- Multi-core on-the-fly SCC decomposition PPoPP 2016
- An example of goal-directed, calculational proof JFP 2024
- A GPU implementation of inclusion-based points-to analysis PPoPP 2012
- A Truly Symbolic Linear-Time Algorithm for SCC Decomposition TACAS 2023
- SCCMulti: an improved parallel strongly connected components algorithm PPoPP 2014
- Divide-and-Conquer Determinization of Büchi Automata Based on SCC Decomposition CAV 2022