Making Graphs Compact by Lossless Contraction-Reference-Cited by-同舟云学术

Making Graphs Compact by Lossless Contraction

Published:2021-06-09 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2021 International Conference on Management of Data
language:
Short-container-title:

Author:

Fan Wenfei¹,Li Yuanhao²,Liu Muyang³,Lu Can⁴

Affiliation:

1. University of Edinburgh, Shenzhen Institute of Computing Sciences, & Beihang University, Edinburgh, England UK

2. University of Edinburgh, Edinburgh , England UK

3. University of Edinburgh, Edinburgh, England UK

4. Shenzhen Institute of Computing Sciences, Shenzhen, China

Funder

European Research Council

EPSRC Centre for Doctoral Training in Pervasive Parallelism

NSFC

Royal Society Wolfson Research Merit Award

Publisher

ACM

Link

Reference50 articles.

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

2. Poligras: Policy-Based Graph Summarization;Proceedings of the VLDB Endowment;2024-06

3. FRESH: Towards Efficient Graph Queries in an Outsourced Graph;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

4. Efficient and Effective Path Compression in Large Graphs;2023 IEEE 39th International Conference on Data Engineering (ICDE);2023-04

5. Graph Summarization via Node Grouping: A Spectral Algorithm;Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining;2023-02-27