Distributed Maximal Independent Set Computation in Hundred Billion-Edge Graphs

Συγγραφείς: Liu, Yisheng, Pearce, Roger, Reza, Tahsin

Πηγή: 2026 25th International Symposium on Parallel and Distributed Computing (ISPDC) ISPDC Parallel and Distributed Computing (ISPDC), 2026 25th International Symposium on. :93-102 Jul, 2026

Relation: 2026 25th International Symposium on Parallel and Distributed Computing (ISPDC)

Minimizing Total Biharmonic Distance in Large Graphs via Link Recommendation

Συγγραφείς: Zhou, Xinna, Zhang, Zhongzhi

Πηγή: Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.1. :2088-2099

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3770854.3780204

LiBRA: Enhancing Live-streaming Recommendation with Bigraph-based Capacity-aware Ranking Approach

Συγγραφείς: Zhang, Youran, Guo, Xiaotong, Lu, Jiayi, Yu, Runze, Cai, Zhuang, Wang, Qinglei

Πηγή: Proceedings of the 49th International ACM SIGIR Conference on Research and Development in Information Retrieval. :5077-5081

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3805712.3808456

Near-Optimal Bounds for Adversarial Wake-up in Distributed Networks

Συγγραφείς: Robinson, Peter, Tan, Ming Ming

Πηγή: Proceedings of the 38th ACM Symposium on Parallelism in Algorithms and Architectures. :355-365

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3816782.3819199

Lower Bounds on Flow Sparsifiers with Steiner Nodes

Συγγραφείς: Chen, Yu, Tan, Zihan, Yang, Mingyang

Πηγή: Proceedings of the 58th Annual ACM Symposium on Theory of Computing. :1365-1375

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3798129.3800846

A Faster Deterministic Algorithm for Fully Dynamic Maximal Matching

Συγγραφείς: Chuzhoy, Julia, Khanna, Sanjeev, Song, Junkai

Πηγή: Proceedings of the 58th Annual ACM Symposium on Theory of Computing. :1604-1615

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3798129.3800868

Biclique Percolation Communities Computation on Temporal Bipartite Graphs

Συγγραφείς: Chen, Z., Huang, H., Yuan, L., Xu, J., Zheng, B., Lin, X.

Πηγή: IEEE Transactions on Knowledge and Data Engineering IEEE Trans. Knowl. Data Eng. Knowledge and Data Engineering, IEEE Transactions on. 38(6):3401-3415 Jun, 2026

Breaking the Scalability Barrier in Constrained Graph-Based Networked Control via Decision-Focused Learning

Συγγραφείς: Yang, Zhaoxing, Guo, Yuchen, Li, Wenlong, Fan, Guiyun, Jin, Haiming, Kong, Linghe

Πηγή: Proceedings of the ACM Web Conference 2026. :947-958

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3774904.3792331

Research on the Application Model of Intelligent Dialogue System through Hybrid Reinforcement Learning-Knowledge Graph Algorithm

Συγγραφείς: Wang, Nana

Πηγή: 2025 IEEE 3rd International Conference on Electrical, Automation and Computer Engineering (ICEACE) Electrical, Automation and Computer Engineering (ICEACE), 2025 IEEE 3rd International Conference on. :1898-1903 Dec, 2025

Relation: 2025 IEEE 3rd International Conference on Electrical, Automation and Computer Engineering (ICEACE)

Parallel Algorithm for Approximate State Graph Exploration With Restricted Memory Footprint

Συγγραφείς: Keller, Jorg, Author, Litzinger, Sebastian, Author

Συνεισφορές: Keller, Jorg, Author, Litzinger, Sebastian, Author

Πηγή: Concurrency and Computation. 38(1)

Θεματικοί όροι: approximate computing, parallel graph algorithm, state transition graph

Περιγραφή αρχείου: electronic

Σύνδεσμος πρόσβασης: https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-220958
https://doi.org/10.1002/cpe.70502

Maximal Balanced Quasi-Clique Enumeration in Signed Graphs

Συγγραφείς: Gao, Jie, Hu, Jia, Hao, Fei, Min, Geyong, Liu, Lei

Πηγή: ACM Transactions on Knowledge Discovery from Data. 20(5):1-36

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3806834

Efficient Algorithms for Computing Random Walk Centrality

Συγγραφείς: Liu, C., Xie, Z., Zehmakan, A.N., Zhang, Z.

Πηγή: IEEE Transactions on Knowledge and Data Engineering IEEE Trans. Knowl. Data Eng. Knowledge and Data Engineering, IEEE Transactions on. 38(1):235-247 Jan, 2026

GraphSelect: Embedding-Guided Graph Traversal for Scalable Semantic Paper Search

Συγγραφείς: Ksba, Hosam Mostafa, Ashraf, Mohamed, Arafa, Tamer, Khoriba, Ghada

Πηγή: 2025 16th Student Research Conference on Applied Computing (SRC) Applied Computing (SRC), 2025 16th Student Research Conference on. :1-8 Sep, 2025

Relation: 2025 16th Student Research Conference on Applied Computing (SRC)

Efficient $k$k-Plex Mining in Temporal Graphs

Συγγραφείς: Wu, Y., Sun, R., Wang, X., Zhang, Y., Qin, L., Zhang, W., Lin, X.

Πηγή: IEEE Transactions on Knowledge and Data Engineering IEEE Trans. Knowl. Data Eng. Knowledge and Data Engineering, IEEE Transactions on. 37(12):7105-7119 Dec, 2025

From Global to Query-Dependent: Summarization of Large Hierarchical DAGs

Συγγραφείς: Zhu, Xuliang, Huang, Xin, Wang, Kai, Xu, Jianliang, Lin, Xuemin

Πηγή: ACM Transactions on Database Systems. 51(1):1-31

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3769079

RaNT-Graph: A Scalable Approach to Sampling Billions of Walks or Paths from Weighted Graphs

Συγγραφείς: Fletcher, Lance, Steil, Trevor, Pearce, Roger

Πηγή: 2025 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) IPDPSW Parallel and Distributed Processing Symposium Workshops (IPDPSW), 2025 IEEE International. :777-786 Jun, 2025

Relation: 2025 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)

$\text {GPUSCAN}^{++}$: Efficient Structural Graph Clustering on GPUs

Συγγραφείς: Yuan, L., Zhou, Z., Chen, Z., Lin, X., Zhao, X., Zhang, F.

Πηγή: IEEE Transactions on Parallel and Distributed Systems IEEE Trans. Parallel Distrib. Syst. Parallel and Distributed Systems, IEEE Transactions on. 36(9):1890-1903 Sep, 2025

Efficient Algorithms for Relevant Quantities of Friedkin-Johnsen Opinion Dynamics Model

Συγγραφείς: Wang, Gengyu, Zhang, Runze, Zhang, Zhongzhi

Πηγή: Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2. :2915-2926

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3711896.3736920

A tight meta-theorem for LOCAL certification of MSO2 properties within bounded treewidth graphs

Συγγραφείς: Cook, Linda, Kim, Eun Jung, Masařík, Tomáš

Πηγή: Proceedings of the ACM Symposium on Principles of Distributed Computing. :110-120

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3732772.3733562

Deterministic Dynamic Maximal Matching in Sublinear Update Time

Συγγραφείς: Bernstein, Aaron, Bhattacharya, Sayan, Kiss, Peter, Saranurak, Thatchaphol

Πηγή: Proceedings of the 57th Annual ACM Symposium on Theory of Computing. :132-143

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3717823.3718153