A Distributed Iteration Algorithm for Learning Time-Varying Graph Model

Συγγραφείς: Ma, Mou^Aff1, Jiang, Junzheng^Aff2, Zhou, Fang^{Aff3, IDs00034025033736_cor1}

Πηγή: Circuits, Systems, and Signal Processing. 45(5):3799-3815

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

Introduction

Συγγραφείς: Erciyes, K.^Aff4

Συνεισφορές: Hazzan, Orit, Series Editor^Aff1, Maurer, Frank, Series Editor^Aff2, Erciyes, K.^Aff3

Πηγή: Guide to Graph Algorithms : Sequential, Parallel and Distributed. :1-11

Adaptive Runtime Features for Distributed Graph Algorithms

Συγγραφείς: Firoz, Jesun Sahariar, Zalewski, Marcin, Suetterlein, Joshua, Lumsdaine, Andrew

Πηγή: 2018 IEEE 25th International Conference on High Performance Computing (HiPC) HIPC High Performance Computing (HiPC), 2018 IEEE 25th International Conference on. :82-91 Dec, 2018

Relation: 2018 IEEE 25th International Conference on High Performance Computing (HiPC)

Fast All-Pairs Shortest Paths Algorithm in Large Sparse Graph

Συγγραφείς: Yang, Shaofeng, Liu, Xiandong, Wang, Yunting, He, Xin, Tan, Guangming

Πηγή: Proceedings of the 37th International Conference on Supercomputing. :277-288

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

A new distributed graph coloring algorithm for large graphs

Συγγραφείς: Brighen, Assia^{Aff1, Aff4, IDs1058602303988x_cor1}, Slimani, Hachem^Aff1, Rezgui, Abdelmounaam^Aff2, Kheddouci, Hamamache^Aff3

Πηγή: Cluster Computing: The Journal of Networks, Software Tools and Applications. 27(1):875-891

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

A Distributed Graph Algorithm for Discovering Unique Behavioral Groups from Large-Scale Telco Data

Συγγραφείς: Ho, Qirong, Lin, Wenqing, Shaham, Eran, Krishnaswamy, Shonali, Dang, The Anh, Wang, Jingxuan, Zhongyan, Isabel Choo, She-Nash, Amy

Πηγή: Proceedings of the 25th ACM International on Conference on Information and Knowledge Management. :1353-1362

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

iPartition: a distributed partitioning algorithm for block-centric graph processing systems

Συγγραφείς: Sagharichian, Masoud^{Aff1, IDs1122702305492w_cor1}, Alipour Langouri, Morteza^Aff2

Πηγή: The Journal of Supercomputing: An International Journal of High-Performance Computer Design, Analysis, and Use. 79(18):21116-21143

Distributed graph partitioning to optimise collaborative filtering algorithms

Συγγραφείς: Shahzad, Ahmad

Σύνδεσμος πρόσβασης: https://ethos.blethoshyku.com/concern/thesis_or_dissertations/899142

Distributed Algorithms for Aggregative Games on Graphs

Συγγραφείς: Koshal, Jayash, Nedić, Angelia, Shanbhag, Uday V.

Πηγή: Operations Research, 2016 May 01. 64(3), 680-704.

Σύνδεσμος πρόσβασης: http://www.jstor.org/stable/24740485

A two-phase streaming edge partitioning algorithm for large-scale uncertain graphs

Συγγραφείς: Cui, Huanqing^{Aff1, IDs10586025053385_cor1}, Chang, Anfu^Aff1, Hu, Kekun^Aff2, Dong, Gang^Aff2, Zhu, Jinbin^{Aff1, IDs10586025053385_cor2}

Πηγή: Cluster Computing: The Journal of Networks, Software Tools and Applications. 28(11)

An O(n2) Self-Stabilizing Algorithm for Minimal Total Dominating Set in Arbitrary Graphs

Συγγραφείς: Ding, Yihua, Wang, James Z, srimani, Pradip K

Πηγή: 2020 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT) WI-IAT Web Intelligence and Intelligent Agent Technology (WI-IAT), 2020 IEEE/WIC/ACM International Joint Conference on. :49-54 Dec, 2020

Relation: 2020 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)

Towards distributed two-stage stochastic optimization

Συγγραφείς: Emek, Yuval^{Aff1, IDs00446025004868_cor1}, Harlev, Noga^Aff1, Izumi, Taisuke^Aff2

Πηγή: Distributed Computing. 38(4):377-395

AKIN: A Streaming Graph Partitioning Algorithm for Distributed Graph Storage Systems

Συγγραφείς: Zhang, Wei, Chen, Yong, Dai, Dong

Θεματικοί όροι: Applied Mathematics, Information and Computing Sciences, Pure Mathematics, Mathematical Sciences, Data Management and Data Science, Distributed Computing and Systems Software, Graph Partitioning, Graph Database, Distributed System, Graph Storage

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

Σύνδεσμος πρόσβασης: https://escholarship.org/uc/item/8x13h2dg
https://escholarship.org/content/qt8x13h2dg/qt8x13h2dg.pdf

Tight bounds on the message complexity of distributed tree verification

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

Συνεισφορές: Shay Kutten and Peter Robinson and Ming Ming Tan

Πηγή: Distributed Computing. 38:113-130

Θεματικοί όροι: FOS: Computer and information sciences, Distributed Graph Algorithm, message complexity, Lower Bound, Communication complexity, information complexity, Computer Science - Distributed, Parallel, and Cluster Computing, Graph theory (including graph drawing) in computer science, distributed graph verification, Computer Science - Data Structures and Algorithms, Distributed algorithms, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC), lower bound, distributed minimum spanning tree

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

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

Fast distributed algorithms for connectivity and MST in Large Graphs

Συγγραφείς: Pandurangan, G., Author, Robinson, P., Author, Scquizzato, Michele, Author

Συνεισφορές: Pandurangan, G., Author, Robinson, P., Author, Scquizzato, Michele, Author

Πηγή: ACM Transactions on Parallel Computing. 5(1):1-22

Θεματικοί όροι: Distributed graph algorithms, Graph connectivity, Graph sketching, Minimum spanning trees, Distributed computer systems, Algorithmic foundations, Communication complexity, Connectivity algorithms, Poly-logarithmic factors, Trees (mathematics)

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

Σύνδεσμος πρόσβασης: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-314288

Ja-be-Ja: A Distributed Algorithm for Balanced Graph Partitioning

Συγγραφείς: Rahimian, Fatemeh, Author, Payberah, Amir, Author, Girdzijauskas, Sarunas, Author, Jelasity, Mark, Author, Haridi, Seif, Author

Συνεισφορές: Rahimian, Fatemeh, Author, Payberah, Amir, Author, Girdzijauskas, Sarunas, Author, Jelasity, Mark, Author, Haridi, Seif, Author

Πηγή: SICS Technical Report.

Θεματικοί όροι: graph partitioning, distributed algorithm, load balancing

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

Σύνδεσμος πρόσβασης: https://urn.kb.se/resolve?urn=urn:nbn:se:ri:diva-24165
https://ri.diva-portal.org/smash/get/diva2:1043244/FULLTEXT01.pdf

A distributed graph algorithm for the detection of local cycles and knots

Συγγραφείς: Boukerche, A., Tropper, C.

Πηγή: IEEE Transactions on Parallel and Distributed Systems IEEE Trans. Parallel Distrib. Syst. Parallel and Distributed Systems, IEEE Transactions on. 9(8):748-757 Aug, 1998

Communication-efficient Massively Distributed Connected Components

Συγγραφείς: Lamm, Sebastian, Sanders, Peter

Πηγή: 2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS) IPDPS Parallel and Distributed Processing Symposium (IPDPS), 2022 IEEE International. :302-312 May, 2022

Relation: 2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS)