A parameter-free approach to lossless summarization of fully dynamic graphs-Reference-Cited by-同舟云学术

A parameter-free approach to lossless summarization of fully dynamic graphs

Published:2022-04 Issue: Volume:589 Page:376-394
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Ma Ziyi,Liu Yuling,Yang Zhibang,Yang Jianye,Li Kenli

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference39 articles.

1. Best bang for the buck: Cost-effective seed selection for online social networks;Han;IEEE Trans. Knowl. Data Eng.,2019

2. Efficient and incremental clustering algorithms on star-schema heterogeneous graphs;Chen,2019

3. Efficient graph query processing over geo-distributed datacenters;Yuan,2020

4. Reachability preserving compression for dynamic graph;Liang;Inf. Sci.,2020

5. W. Luo, X. Zhou, J. Yang, P. Peng, G. Xiao, Y. Gao, Efficient approaches to top-r influential community search, IEEE Internet Things J.

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

1. A Two-stage Coarsening Method for a Streaming Graph with Preserving Key Features;Proceedings of the 2024 International Conference on Generative Artificial Intelligence and Information Security;2024-05-10

2. Persistent graph stream summarization for real-time graph analytics;World Wide Web;2023-05-05

3. Drift Detection of Intelligent Sensor Networks Deployment Based on Graph Stream;IEEE Transactions on Network Science and Engineering;2023-03-01

4. Incremental Refinement of Relevance Rankings: Introducing a New Method Supported with Pennant Retrieval;Turk Kutuphaneciligi - Turkish Librarianship;2022-04-10