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)

Scalable Algorithms for Information Centrality Optimization via Global Edge Addition

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

Πηγή: Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2. :6535-6545

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

ECHO: Adaptive Community Search over Multimodal Graphs

Συγγραφείς: Luo, Chengyang, Ding, Zixing, Liu, Qing, Zhu, Yifan, Gao, Yunjun

Πηγή: Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2. :3458-3469

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

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

Research on an AI-Supported Personalized Learning System for Rule of Law Education

Συγγραφείς: Liu, Tao, Wang, Huan

Πηγή: Proceedings of the 3rd International Conference on Educational Digitalization and Computer Science in the Guangdong-Hong Kong-Macao Greater Bay Area. :959-964

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

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

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

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 Algorithm for Opinion Optimization via Leader Selection in Directed Social Networks

Συγγραφείς: Zhou, X., Zhang, Z.

Πηγή: IEEE Transactions on Networking IEEE Trans. Netw. Networking, IEEE Transactions on. 34:7122-7132 2026

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

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)

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

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

Independent Set Reconfiguration on Directed Graphs

Συγγραφείς: Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa

Συνεισφορές: Takehiro Ito and Yuni Iwamasa and Yasuaki Kobayashi and Yu Nakahata and Yota Otachi and Masahiro Takahashi and Kunihiro Wasa

Πηγή: SIAM Journal on Discrete Mathematics. 40:82-101

Θεματικοί όροι: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), 0102 computer and information sciences, 02 engineering and technology, directed graph, Combinatorial reconfiguration, 01 natural sciences, token sliding, independent set, graph algorithm, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), Computer Science - Discrete Mathematics

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2203.13435
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.58