Suchergebnisse - Randomised Distributed Graph Algorithm*

About randomised distributed graph colouring and graph partition algorithms

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

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

Quelle: Information and Computation. 208:1296-1304

Schlagwörter: 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

Zugangs-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

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

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

Quelle: Distributed Computing. 23:331-340

Schlagwörter: [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

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

Tight bounds on the message complexity of distributed tree verification

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

Weitere Verfasser: Kutten, Shay Robinson, Peter Tan, Ming Ming et al.

Quelle: Distributed Computing. 38:113-130

Schlagwörter: 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

Dateibeschreibung: application/pdf

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

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

Autoren: ELKIN, M.

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

Schlagwörter: ALGORITHMS, DISTRIBUTED algorithms, RADIUS (Geometry), DETERMINISTIC algorithms, GRAPH algorithms, SPANNING trees, HOPPING conduction

On the Use of Randomness in Local Distributed Graph Algorithms

Autoren: Fabian Kuhn Mohsen Ghaffari

Quelle: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing. :290-299

Schlagwörter: FOS: Computer and information sciences, Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC), 0102 computer and information sciences, 01 natural sciences

Zugangs-URL: http://arxiv.org/pdf/1906.00482
http://arxiv.org/abs/1906.00482
https://dl.acm.org/doi/10.1145/3293611.3331610
https://doi.org/10.1145/3293611.3331610
https://www.research-collection.ethz.ch/handle/20.500.11850/361613
https://dblp.uni-trier.de/db/conf/podc/podc2019.html#GhaffariK19

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

Autoren: Junlong Zhu Xin Wang Mingchuan Zhang et al.

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

Schlagwörter: 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

Dateibeschreibung: electronic resource

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

Zugangs-URL: https://doaj.org/article/5807c383284647558f25c9c193a692f9

Fast distributed algorithms for connectivity and MST in Large Graphs

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

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

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

Dateibeschreibung: print

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

Fast Distributed Algorithms for Connectivity and MST in Large Graphs

Autoren: Pandurangan, Gopal Robinson, Peter Scquizzato, Michele

Quelle: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures. :429-438

Schlagwörter: FOS: Computer and information sciences, Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Data Structures and Algorithms, C.2.4, F.1.1, Data Structures and Algorithms (cs.DS), Distributed graph algorithms, Graph connectivity, Graph sketching, Massive graphs, Minimum spanning trees, Software, Theoretical Computer Science, Hardware and Architecture, Distributed, Parallel, and Cluster Computing (cs.DC), 16. Peace & justice, Computational Theory and Mathematics, Modeling and Simulation

Zugangs-URL: http://dl.acm.org/ft_gateway.cfm?id=2935785&type=pdf
https://dl.acm.org/doi/pdf/10.1145/3209689
http://arxiv.org/abs/1503.02353
https://dl.acm.org/doi/10.1145/2935764.2935785
http://ui.adsabs.harvard.edu/abs/2015arXiv150302353P/abstract
https://core.ac.uk/display/29517304
https://dl.acm.org/doi/pdf/10.1145/2935764.2935785
https://dblp.uni-trier.de/db/conf/spaa/spaa2016.html#Pandurangan0S16
https://scholars.cityu.edu.hk/en/publications/fast-distributed-algorithms-for-connectivity-and-mst-in-large-graphs(1e404988-73a9-462e-a3fc-53ecf0e68775).html
https://dl.acm.org/doi/pdf/10.1145/3209689
https://doi.org/10.1145/3209689
https://dl.acm.org/doi/10.1145/3209689
https://dblp.uni-trier.de/db/journals/topc/topc5.html#PanduranganRS18
https://hdl.handle.net/11577/3300961
https://doi.org/10.1145/2935764.2935785
http://dl.acm.org/citation.cfm?id=J1496&picked=prox&cfid=789649777&cftoken=14890638
https://doi.org/10.1145/3209689
https://hdl.handle.net/11577/3290299

Efficient randomized distributed coloring in CONGEST

Autoren: Halldórsson, Magnús M. Kuhn, Fabian Maus, Yannic et al.

Quelle: STOC
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing

Schlagwörter: FOS: Computer and information sciences, Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC), 0102 computer and information sciences, 01 natural sciences

Zugangs-URL: http://arxiv.org/pdf/2012.14169
http://arxiv.org/abs/2012.14169
https://arxiv.org/abs/2012.14169
https://dblp.uni-trier.de/db/conf/stoc/stoc2021.html#HalldorssonKMT21
http://acm-stoc.org/stoc2021/accepted-papers.html#95

No Distributed Quantum Advantage for Approximate Graph Coloring

Autoren: Xavier Coiteux-Roy Francesco d'Amore Rishikesh Gajjala et al.

Weitere Verfasser: Xavier Coiteux-Roy Francesco d'Amore Rishikesh Gajjala et al.

Quelle: Proceedings of the 56th Annual ACM Symposium on Theory of Computing. :1901-1910

Schlagwörter: FOS: Computer and information sciences, Quantum Physics, Discrete Mathematics (cs.DM), No-signalling, Local model, Communication complexity, Computer Science - Emerging Technologies, FOS: Physical sciences, Quantum computing, Computational Complexity (cs.CC), non-signaling model, Distributed coloring, distributed computing, Computer Science - Computational Complexity, quantum advantage, Emerging Technologies (cs.ET), Computer Science - Distributed, Parallel, and Cluster Computing, graph coloring, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Distributed, Parallel, and Cluster Computing (cs.DC), Quantum Physics (quant-ph), [PHYS.QPHY] Physics [physics]/Quantum Physics [quant-ph], Computer Science - Discrete Mathematics

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2307.09444
https://aaltodoc.aalto.fi/handle/123456789/129645

Lower Bounds for Maximal Matchings and Maximal Independent Sets.

Autoren: BALLIU, ALKIDA BRANDT, SEBASTIAN HIRVONEN, JUHO et al.

Quelle: Journal of the ACM; Sep2021, Vol. 68 Issue 5, p1-30, 30p

Schlagwörter: INDEPENDENT sets, GRAPH algorithms, DISTRIBUTED computing, OPEN-ended questions

Towards Optimal Distributed Edge Coloring with Fewer Colors

Autoren: Jakob, Manuel Maus, Yannic Schager, Florian et al.

Weitere Verfasser: Jakob, Manuel Maus, Yannic Schager, Florian et al.

Schlagwörter: FOS: Computer and information sciences, Computer Science - Distributed, Parallel, and Cluster Computing, distributed graph algorithms, Computer Science - Data Structures and Algorithms, LOCAL model, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC), ddc:004, edge coloring

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2504.13003
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2025.37

Dynamic Maximal Matching in Clique Networks

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

Weitere Verfasser: Li, Minming Robinson, Peter Zhu, Xianbin et al.

Schlagwörter: 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

Dateibeschreibung: application/pdf

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

An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms: An experimental analysis of simple, distributed vertex coloring algorithms

Autoren: FINOCCHI, Irene PANCONESI, Alessandro SILVESTRI, RICCARDO

Quelle: Algorithmica. 41:1-23

Schlagwörter: 4. Education, Randomized algorithms, Vertex coloring, 0102 computer and information sciences, 02 engineering and technology, 7. Clean energy, 01 natural sciences, Coloring of graphs and hypergraphs, Graph theory (including graph drawing) in computer science, Graph algorithms (graph-theoretic aspects), Distributed graph algorithms, 0202 electrical engineering, electronic engineering, information engineering, Distributed algorithms, 10. No inequality, Algorithm engineering

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/2135854
https://doi.org/10.1007/s00453-004-1104-3
https://dblp.uni-trier.de/db/conf/soda/soda2002.html#FinocchiPS02
https://link.springer.com/article/10.1007/s00453-004-1104-3
https://doi.acm.org/10.1145/545381.545461
https://iris.luiss.it/handle/11385/192691
https://dl.acm.org/doi/10.5555/545381.545461
http://apps.webofknowledge.com/full_record.do?product=WOS&search_mode=GeneralSearch&qid=1&SID=T2mejPEI@2BnoIEaJ@I&page=4&doc=34
https://doi.org/10.1145/545381.545461
https://hdl.handle.net/11573/250401
http://apps.webofknowledge.com/full_record.do?product=WOS&search_mode=GeneralSearch&qid=1&SID=T2mejPEI@2BnoIEaJ@I&page=4&doc=34
https://hdl.handle.net/11385/192691

Simplifying Distributed Neural Network Training on Massive Graphs: Randomized Partitions Improve Model Aggregation.

Autoren: Zhu, Jiong Reganti, Aishwarya Huang, Edward W. et al.

Quelle: ACM Transactions on Knowledge Discovery from Data; Jan2025, Vol. 19 Issue 1, p1-26, 26p

Schlagwörter: GRAPH neural networks, SOCIAL networks, UNIFORMITY

On the Use of Randomness in Local Distributed Graph Algorithms

Autoren: Ghaffari, Mohsen Kuhn, Fabian

Index Begriffe: Computer Science - Data Structures and Algorithms, Computer Science - Distributed, Parallel, and Cluster Computing, text

URL: http://arxiv.org/abs/1906.00482

Node and edge averaged complexities of local graph problems.

Autoren: Balliu, Alkida Ghaffari, Mohsen Kuhn, Fabian et al.

Quelle: Distributed Computing; Dec2023, Vol. 36 Issue 4, p451-473, 23p

Schlagwörter: DISTRIBUTED algorithms, GRAPH algorithms, SYMMETRY breaking, INDEPENDENT sets

Deterministic Distributed Symmetry Breaking at the Example of Distributed Graph Coloring (Invited Talk)

Autoren: Kuhn, Fabian Fabian Kuhn

Weitere Verfasser: Kuhn, Fabian Fabian Kuhn

Schlagwörter: distributed coloring, distributed graph algorithms, ddc:004, derandomization

Dateibeschreibung: application/pdf

Zugangs-URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2022.3

Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions

Autoren: Becker, Ruben Emek, Yuval Ghaffari, Mohsen et al.

Quelle: SIAM Journal on Computing. 53:247-286

Schlagwörter: distributed graph algorithms, parallel graph algorithms, (semi-)streaming graph algorithms, metric tree embeddings, low-stretch trees, graph decompositions

Distributed Small Cuts using Semigroups

Autoren: Augustine, John Mohit Daga, Mohit

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

Schlagwörter: Distributed Algorithms, Edge Connectivity, Small Cuts

Dateibeschreibung: print

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