.png){kind=icon}
返回
Grammar-based graph compression
.png){kind=icon}
OA
AI
DOI：10.1016/j.is.2018.03.002.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Graph compression
Straight-line context-free hyperedge replacement grammar
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.9
论文数:
2.8K
被引数:
1.8K
机构
引用论文
Chapter II: Toward a Theory of Standards-based Reform: The Case of Nine NSF Statewide Systemic Initiatives1第二章：迈向基于标准的改革理论：九个NSF全州系统性倡议1的案例
PREAI
分享收藏Does Top-Down, Standards-Based Reform Work? A Review of the Status of Statewide Standards- Based Reform自上而下、基于标准的改革有效吗？——对全州范围内基于标准的改革现状的综述
PREAI
分享收藏分享收藏Optimised Anaesthesia to Reduce Post Operative Cognitive Decline (POCD) in Older Patients Undergoing Elective Surgery, a Randomised Controlled Trial.png)
PLoS ONEOAAI
PLoS ONEIF0
OAAI分享收藏分享收藏
查看更多内容