AORM: Fast Incremental Arbitrary-Order Reachability Matrix Computation for Massive Graphs

IEEE Access, vol. 9, pp. 69539-69558, 2021
← Back to References

Bibliographic Information

TitleAORM: Fast Incremental Arbitrary-Order Reachability Matrix Computation for Massive Graphs
AuthorsSung-Soo Kim, Young-Kuk Kim, Young-Min Kang
VenueIEEE Access, vol. 9, pp. 69539-69558
Year2021
Linkhttps://ieeexplore.ieee.org/document/9424548

Summary

Introduces incremental arbitrary-order reachability computation using boolean matrices and path pruning. Uniquely supports directed and disconnected graphs. Achieves up to 11x speedup over NetworkX on synthetic and real-world networks. STRATA extends this framework with sparse matrices, Cython acceleration, and dynamic support.