.png){kind=icon}
Return
Grammar-based graph compression
.png){kind=icon}
OA
AI
DOI：10.1016/j.is.2018.03.002.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present a new graph compressor that works by recursively detecting repeated substructures and representing them through grammar rules. We show that for a large number of graphs the compressor obtains smaller representations than other approaches. Specific queries such as reachability between two nodes or regular path queries can be evaluated in linear time (or quadratic times, respectively), over the grammar, thus allowing speed-ups proportional to the compression ratio. (C) 2018 Elsevier Ltd. All rights reserved.
Keywords:
Graph compression
Straight-line context-free hyperedge replacement grammar
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.9
Papers:
2.8K
Citations:
1.8K
Organization
Cited Papers
ShareSaveShareSaveShareSaveShareSaveOptimised Anaesthesia to Reduce Post Operative Cognitive Decline (POCD) in Older Patients Undergoing Elective Surgery, a Randomised Controlled Trial.png)
PLoS ONEOAAI
PLoS ONEIF0
OAAIShareSaveShareSave
View more