HcRPC: Highly Compact Reachability Preserving Graph Compression With Corrections
Graphs are used in numerous applications to model real-world systems and phenomena. The ever increasing size of graphs makes them difficult to query and analyze. In this paper, we propose HcRPC, a Highly compact Reachability Preserving Graph compression algorithm with Corrections, which is capable o...
Main Authors: | Rui Bing, Huifang Ma, Xiangchun He, Zhixin Li, Lijun Guo |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2019-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8839789/ |
Similar Items
-
STAT: a fast, scalable, MinHash-based k-mer tool to assess Sequence Read Archive next-generation sequence submissions
by: Kenneth S. Katz, et al.
Published: (2021-09-01) -
Modular Decomposition-Based Graph Compression for Fast Reachability Detection
by: Shikha Anirban, et al.
Published: (2019-08-01) -
Efficient evaluation of reachability query for directed acyclic XML graph based on a prime number labelling schema
by: Awny Sayed, et al.
Published: (2012-11-01) -
Mash Screen: high-throughput sequence containment estimation for genome discovery
by: Brian D. Ondov, et al.
Published: (2019-11-01) -
Viral coinfection analysis using a MinHash toolkit
by: Eric T. Dawson, et al.
Published: (2019-07-01)