AORM: Fast Incremental Arbitrary-Order Reachability Matrix Computation for Massive Graphs
Processing a reachability query in large-scale networks using existing methods remains one of the most challenging problems in graph mining. In this paper, we propose a novel incremental algorithmic framework for arbitrary-order reachability computation in massive graphs. The proposed method is intu...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2021-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9424548/ |