Parallel Batch-Dynamic Algorithms for k-Core Decomposition and Related Graph Problems-Reference-Cited by-同舟云学术

Parallel Batch-Dynamic Algorithms for k-Core Decomposition and Related Graph Problems

Published:2022-07-11 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures
language:
Short-container-title:

Author:

Liu Quanquan C.¹,Shi Jessica²,Yu Shangdi²,Dhulipala Laxman³,Shun Julian²

Affiliation:

1. Northwestern University, Evanston, IL, USA

2. MIT CSAIL, Cambridge, MA, USA

3. University of Maryland, College Park, MD, USA

Funder

Department of Energy, Labor and Economic Growth

National Science Foundation

Google

Defense Advanced Research Projects Agency

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3490148.3538569

Reference71 articles.

1. J. Ignacio Alvarez-Hamelin , Luca Dall'Asta , Alain Barrat , and Alessandro Vespignani . 2005 . Large Scale Networks Fingerprinting and Visualization Using the k-Core Decomposition . In International Conference on Neural Information Processing Systems. J. Ignacio Alvarez-Hamelin, Luca Dall'Asta, Alain Barrat, and Alessandro Vespignani. 2005. Large Scale Networks Fingerprinting and Visualization Using the k-Core Decomposition. In International Conference on Neural Information Processing Systems.

2. Altaf Amin , Yoko Shinbo , Kenji Mihara , Ken Kurokawa , and Shigehiko Kanaya . 2006. Development and implementation of an algorithm for detection of protein complexes in large interaction networks. BMC bioinformatics 7 (02 2006 ), 207. Altaf Amin, Yoko Shinbo, Kenji Mihara, Ken Kurokawa, and Shigehiko Kanaya. 2006. Development and implementation of an algorithm for detection of protein complexes in large interaction networks. BMC bioinformatics 7 (02 2006), 207.

3. Sabeur Aridhi , Martin Brugnara , Alberto Montresor , and Yannis Velegrakis . 2016 . Distributed -Core Decomposition and Maintenance in Large Dynamic Graphs. In ACM International Conference on Distributed and Event-Based Systems. 161--168 . Sabeur Aridhi, Martin Brugnara, Alberto Montresor, and Yannis Velegrakis. 2016. Distributed -Core Decomposition and Maintenance in Large Dynamic Graphs. In ACM International Conference on Distributed and Event-Based Systems. 161--168.

4. A Simple Greedy Algorithm for Dynamic Graph Orientation

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

1. Parallel Dynamic Maximal Matching;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17

2. Deterministic and Low-Span Work-Efficient Parallel Batch-Dynamic Trees;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17

3. Streaming Graph Algorithms in the Massively Parallel Computation Model;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17

4. Simplified algorithms for order-based core maintenance;The Journal of Supercomputing;2024-05-28

5. Fast Multilayer Core Decomposition and Indexing;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13