Search Results - Randomised Distributed Graph Algorithm

About randomised distributed graph colouring and graph partition algorithms

Authors: Métivier, Yves Robson, John Michael Saheb-Djahromi, Nasser et al.

Contributors: Métivier, Yves Robson, John Michael Saheb-Djahromi, Nasser et al.

Source: Information and Computation. 208:1296-1304

Subject Terms: Probabilistic analysis, Graph Partition, Bit complexity, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Probabilistic Analysis, Theoretical Computer Science, Computer Science Applications, [INFO.INFO-OH] Computer Science [cs]/Other [cs.OH], Randomised Distributed Graph Algorithm, Graph partition, Computational Theory and Mathematics, Randomised distributed graph algorithm, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, Bit Complexity, Colouring, Information Systems

Access URL: http://dblp.uni-trier.de/db/journals/iandc/iandc208.html#MetivierRSZ10
https://www.sciencedirect.com/science/article/abs/pii/S0890540110001318
https://www.sciencedirect.com/science/article/pii/S0890540110001318
https://dblp.uni-trier.de/db/journals/iandc/iandc208.html#MetivierRSZ10
https://hal.archives-ouvertes.fr/hal-00515904
http://www.sciencedirect.com/science/article/pii/S0890540110001318

An optimal bit complexity randomized distributed MIS algorithm

Authors: Métivier, Yves Robson, John Michael Saheb-Djahromi, Nasser et al.

Contributors: Métivier, Yves Robson, John Michael Saheb-Djahromi, Nasser et al.

Source: Distributed Computing. 23:331-340

Subject Terms: [INFO.INFO-OH] Computer Science [cs]/Other [cs.OH], bit complexity, Distributed graph algorithm, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, maximal independent set, 01 natural sciences, randomized algorithm

Access URL: https://hal.science/hal-00370970v1
https://hal.science/hal-00517361v1

Tight bounds on the message complexity of distributed tree verification

Authors: Kutten, Shay Robinson, Peter Tan, Ming Ming et al.

Contributors: Kutten, Shay Robinson, Peter Tan, Ming Ming et al.

Source: Distributed Computing. 38:113-130

Subject Terms: FOS: Computer and information sciences, Distributed Graph Algorithm, Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Data Structures and Algorithms, Lower Bound, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC), ddc:004

File Description: application/pdf

Access URL: http://arxiv.org/abs/2401.11991
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2023.26

A distributed gradient algorithm based on randomized block-coordinate and projection-free over networks

Authors: Junlong Zhu Xin Wang Mingchuan Zhang et al.

Source: Complex & Intelligent Systems, Vol 9, Iss 1, Pp 267-283 (2022)

Subject Terms: Block-coordinate descent, Computational complexity, Frank–Wolfe algorithm, Huge-scale optimization, Electronic computers. Computer science, QA75.5-76.95, Information technology, T58.5-58.64

File Description: electronic resource

Relation: https://doaj.org/toc/2199-4536; https://doaj.org/toc/2198-6053

Access URL: https://doaj.org/article/5807c383284647558f25c9c193a692f9

Fast distributed algorithms for connectivity and MST in Large Graphs

Authors: Pandurangan, G. Robinson, P. Scquizzato, Michele

Source: ACM Transactions on Parallel Computing. 5(1):1-22

Subject Terms: Distributed graph algorithms, Graph connectivity, Graph sketching, Minimum spanning trees, Distributed computer systems, Algorithmic foundations, Communication complexity, Connectivity algorithms, Poly-logarithmic factors, Trees (mathematics)

File Description: print

Access URL: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-314288

A Simple Deterministic Distributed MST Algorithm with Near-Optimal Time and Message Complexities.

Authors: ELKIN, M.¹ elkinm@bgu.ac.il

Source: Journal of the ACM. Mar2020, Vol. 67 Issue 2, p1-15. 15p.

Subject Terms: *ALGORITHMS, DISTRIBUTED algorithms, RADIUS (Geometry), DETERMINISTIC algorithms, GRAPH algorithms, SPANNING trees, HOPPING conduction

Dynamic Maximal Matching in Clique Networks

Authors: Li, Minming Robinson, Peter Zhu, Xianbin et al.

Contributors: Li, Minming Robinson, Peter Zhu, Xianbin et al.

Subject Terms: maximal matching, Computer Science - Distributed, Parallel, and Cluster Computing, distributed graph algorithm, Computer Science - Data Structures and Algorithms, dynamic network, ddc:004, lower bound, randomized algorithm

File Description: application/pdf

Access URL: http://arxiv.org/abs/2401.15550
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.73

Distributed Small Cuts using Semigroups

Authors: Augustine, John Mohit Daga, Mohit

Source: ICDCN 2025 - Proceedings of the 26th International Conference on Distributed Computing and Networking. :134-143

Subject Terms: Distributed Algorithms, Edge Connectivity, Small Cuts

File Description: print

Access URL: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-360915
https://doi.org/10.1145/3700838.3700860

DECENTRALIZED LOW-STRETCH TREES VIA LOW DIAMETER GRAPH DECOMPOSITIONS.

Authors: BECKER, RUBEN EMEK, YUVAL GHAFFARI, MOHSEN et al.

Source: SIAM Journal on Computing. 2024, Vol. 53 Issue 2, p247-286. 40p.

Subject Terms: WEIGHTED graphs, UNDIRECTED graphs, SPANNING trees, GRAPH algorithms, DIAMETER, COMPUTATIONAL complexity, BABY strollers

DISTRIBUTED EXACT WEIGHTED ALL-PAIRS SHORTEST PATHS IN RANDOMIZED NEAR-LINEAR TIME.

Authors: BERNSTEIN, AARON NANONGKAI, DANUPON

Source: SIAM Journal on Computing. 2023, Vol. 52 Issue 2, p112-127. 16p.

Subject Terms: *PROBLEM solving, POLYNOMIAL approximation, DIRECTED graphs, APPROXIMATION algorithms, GRAPH algorithms, DISTRIBUTED algorithms

Geographic Terms: NEW York (State)

Company/Entity: IEEE Computer Society

Distributed Graph Coloring : Fundamentals and Recent Developments

Authors: Leonid Barenboim Michael Elkin

Resource Type: eBook.

Subjects: Coding theory, Information theory, Data structures (Computer science)

Categories: COMPUTERS / Computer Science, COMPUTERS / Information Theory

A note on the network coloring game: A randomized distributed (Δ + 1)-coloring algorithm.

Authors: Fryganiotis, Nikolaos Papavassiliou, Symeon Pelekis, Christos

Source: Information Processing Letters. Aug2023, Vol. 182, pN.PAG-N.PAG. 1p.

Subject Terms: GRAPH coloring, SCIENCE in literature, SCIENTIFIC literature, DISTRIBUTED algorithms, COLORS, COLOR

DISTRIBUTED (Δ + 1)-COLORING VIA ULTRAFAST GRAPH SHATTERING.

Authors: YI-JUN CHANG WENZHENG LI PETTIE, SETH

Source: SIAM Journal on Computing. 2020, Vol. 49 Issue 3, p497-539. 43p.

Subject Terms: *DISTRIBUTED computing, *COMPUTER science, DETERMINISTIC algorithms, GRAPH coloring, SYMMETRY breaking

Geographic Terms: THAILAND

Randomized Block Proximal Methods for Distributed Stochastic Big-Data Optimization.

Authors: Farina, Francesco Notarstefano, Giuseppe

Source: IEEE Transactions on Automatic Control. Sep2021, Vol. 66 Issue 9, p4000-4014. 15p.

Subject Terms: *ALGORITHMS, *STOCHASTIC processes, DISTRIBUTED algorithms, STOCHASTIC matrices, DIRECTED graphs, CLASSIFICATION algorithms, STOCHASTIC systems, HEURISTIC algorithms, APPROXIMATION algorithms

DISTRIBUTED LOCAL APPROXIMATION ALGORITHMS FOR MAXIMUM MATCHING IN GRAPHS AND HYPERGRAPHS.

Authors: HARRIS, DAVID G.¹ davidgharris29@gmail.com

Source: SIAM Journal on Computing. 2020, Vol. 49 Issue 4, p711-746. 36p.

Subject Terms: *DISTRIBUTED computing, GRAPH algorithms, DETERMINISTIC algorithms, HYPERGRAPHS, APPROXIMATION algorithms

Distributed (Δ + 1)-Coloring in Sublogarithmic Rounds.

Authors: HARRIS, DAVID G. SCHNEIDER, JOHANNES Hsin-Hao Su

Source: Journal of the ACM. Apr2018, Vol. 65 Issue 4, p1-21. 21p.

Subject Terms: *DISTRIBUTED computing, *ALGORITHMS, *COMPUTER networks, GRAPH theory, WIRELESS sensor nodes

Local Deal-Agreement Algorithms for Load Balancing in Dynamic General Graphs.

Authors: Dinitz, Yefim Dolev, Shlomi Kumar, Manish

Source: Theory of Computing Systems. Apr2023, Vol. 67 Issue 2, p348-382. 35p.

Subject Terms: *ALGORITHMS, DYNAMIC balance (Mechanics), DYNAMIC loads, DISTRIBUTED algorithms, DETERMINISTIC algorithms, LOCAL mass media, TIMEKEEPING

A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching

Authors: Naoki KITAMURA Taisuke IZUMI

Source: IEICE Transactions on Information and Systems. 2022, E105.D(3):634

A New Randomized Block-Coordinate Primal-Dual Proximal Algorithm for Distributed Optimization.

Authors: Latafat, Puya Freris, Nikolaos M. Patrinos, Panagiotis

Source: IEEE Transactions on Automatic Control. Oct2019, Vol. 64 Issue 10, p4050-4065. 16p.

Subject Terms: *PROCESS optimization, DISTRIBUTED algorithms, CONVEX functions, LINEAR operators, SYMMETRIC matrices

Distributed Randomized Gradient-Free Mirror Descent Algorithm for Constrained Optimization.

Authors: Yu, Zhan Ho, Daniel W. C. Yuan, Deming

Source: IEEE Transactions on Automatic Control. Feb2022, Vol. 67 Issue 2, p957-964. 8p.

Subject Terms: *MATHEMATICAL optimization, *LINEAR programming, CONSTRAINED optimization, NONSMOOTH optimization, DISTRIBUTED algorithms, MIRRORS, EUCLIDEAN algorithm, APPROXIMATION algorithms