Tight bounds on the message complexity of distributed tree verification

Authors: Kutten, Shay, Robinson, Peter, Tan, Ming Ming

Contributors: Shay Kutten and Peter Robinson and Ming Ming Tan

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

Brief Announcement: Perfect Matching with Few Link Activations

Authors: Mirault, Hugo^Aff10, Robinson, Peter^Aff10, Tan, Ming Ming^Aff10, Zhu, Xianbin^Aff11

Contributors: Goos, Gerhard, Series Editor^{Aff1, Aff3}, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Editorial Board Member^Aff4, Gao, Wen, Editorial Board Member^Aff5, Steffen, Bernhard, Editorial Board Member^Aff6, Yung, Moti, Editorial Board Member^Aff7, Schmid, Ulrich, editor^Aff8, Kuznets, Roman, editor^Aff9

Source: Structural Information and Communication Complexity : 32nd International Colloquium, SIROCCO 2025, Delphi, Greece, June 2–4, 2025, Proceedings. 15671:437-443

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

Authors: Ding, Yihua, Wang, James Z, srimani, Pradip K

Source: 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)

Fast All-Pairs Shortest Paths Algorithm in Large Sparse Graph

Authors: Yang, Shaofeng, Liu, Xiandong, Wang, Yunting, He, Xin, Tan, Guangming

Source: Proceedings of the 37th International Conference on Supercomputing. :277-288

Availability: http://dl.acm.org/doi/10.1145/3577193.3593728

Dynamic Maximal Matching in Clique Networks

Authors: Li, Minming, Robinson, Peter, Zhu, Xianbin

Contributors: Minming Li and Peter Robinson and Xianbin Zhu

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

The Message Complexity of Distributed Graph Optimization

Authors: Dufoulon, Fabien, Pai, Shreyas, Pandurangan, Gopal, Pemmaraju, Sriram V., Robinson, Peter

Contributors: Fabien Dufoulon and Shreyas Pai and Gopal Pandurangan and Sriram V. Pemmaraju and Peter Robinson

Subject Terms: Distributed graph algorithm, message complexity, distributed approximation

File Description: application/pdf

Relation: Is Part Of LIPIcs, Volume 287, 15th Innovations in Theoretical Computer Science Conference (ITCS 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.41

Availability: https://doi.org/10.4230/LIPIcs.ITCS.2024.41
https://nbn-resolving.org/urn:nbn:de:0030-drops-195690
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.41

Tight Bounds on the Message Complexity of Distributed Tree Verification

Authors: Kutten, Shay, Robinson, Peter, Tan, Ming Ming

Contributors: Shay Kutten and Peter Robinson and Ming Ming Tan

Subject Terms: Distributed Graph Algorithm, Lower Bound

File Description: application/pdf

Relation: Is Part Of LIPIcs, Volume 286, 27th International Conference on Principles of Distributed Systems (OPODIS 2023); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2023.26

Availability: https://doi.org/10.4230/LIPIcs.OPODIS.2023.26
https://nbn-resolving.org/urn:nbn:de:0030-drops-195163
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2023.26

A distributed approach to weighted frequent Subgraph mining

Authors: Babu, Nisha, John, Ansamma

Source: 2016 International Conference on Emerging Technological Trends (ICETT) Emerging Technological Trends (ICETT), International Conference on. :1-7 Oct, 2016

Relation: 2016 International Conference on Emerging Technological Trends (ICETT)

The Message Complexity of Distributed Graph Optimization

Authors: Dufoulon, Fabien, Pai, Shreyas, Pandurangan, Gopal, Pemmaraju, Sriram, Robinson, Peter

Contributors: Fabien Dufoulon and Shreyas Pai and Gopal Pandurangan and Sriram V. Pemmaraju and Peter Robinson, Guruswami, Venkatesan, Department of Computer Science, Lancaster University, University of Houston, University of Iowa, Augusta University, Aalto-yliopisto, Aalto University

Subject Terms: distributed approximation, FOS: Computer and information sciences, message complexity, Computer Science - Distributed, Parallel, and Cluster Computing, Distributed graph algorithm, Distributed, Parallel, and Cluster Computing (cs.DC), ddc:004

File Description: application/pdf

Access URL: http://arxiv.org/abs/2311.14811
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.41
https://aaltodoc.aalto.fi/handle/123456789/130419

Distributed Sketching Lower Bounds for k-Edge Connected Spanning Subgraphs, BFS Trees, and LCL Problems

Authors: Robinson, Peter

Contributors: Peter Robinson

Subject Terms: Distributed graph algorithm, streaming, ddc:004, graph sketching

File Description: application/pdf

Access URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.32

Low diameter graph decompositions by approximate distance computation

Authors: Becker R., Emek Y., Lenzen C.

Contributors: Becker, R., Emek, Y., Lenzen, C.

Subject Terms: (semi-)streaming graph algorithm, Distributed graph algorithm, Graph decomposition, Metric tree embedding, Parallel graph algorithms, Settore INF/01 - Informatica

Relation: ispartofbook:Leibniz International Proceedings in Informatics, LIPIcs; 11th Innovations in Theoretical Computer Science Conference, ITCS 2020; volume:151; serie:LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS; https://hdl.handle.net/10278/5029564

Availability: https://hdl.handle.net/10278/5029564
https://doi.org/10.4230/LIPIcs.ITCS.2020.50

Distributed algorithms for low stretch spanning trees

Authors: Becker R., Emek Y., Ghaffari M., Lenzen C.

Contributors: Becker, R., Emek, Y., Ghaffari, M., Lenzen, C.

Subject Terms: Ball decomposition, CONGEST model, Distributed graph algorithm, Low-stretch spanning tree, Star decomposition, Settore INF/01 - Informatica

Relation: ispartofbook:Leibniz International Proceedings in Informatics, LIPIcs; 33rd International Symposium on Distributed Computing, DISC 2019; volume:146; serie:LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS; https://hdl.handle.net/10278/5029572

Availability: https://hdl.handle.net/10278/5029572
https://doi.org/10.4230/LIPIcs.DISC.2019.4

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

Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions

Authors: Becker, Ruben, Emek, Yuval, Ghaffari, Mohsen, Lenzen, Christoph

Contributors: Becker, Ruben, Emek, Yuval, Ghaffari, Mohsen, Lenzen, Christoph

Subject Terms: distributed graph algorithm, parallel graph algorithm, (semi-)streaming graph algorithm, metric tree embedding, low-stretch tree, graph decompositions, Settore INF/01 - Informatica

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:001185608700001; volume:53; issue:2; firstpage:247; lastpage:286; numberofpages:40; journal:SIAM JOURNAL ON COMPUTING; https://hdl.handle.net/10278/5068732

Availability: https://hdl.handle.net/10278/5068732
https://doi.org/10.1137/22m1489034

Distributed Graph Algorithms

Authors: Raynal, Michel^Aff1

Contributors: Raynal, Michel^Aff2

Source: Distributed Algorithms for Message-Passing Systems. :35-58

About randomised distributed graph colouring and graph partition algorithms

Authors: Métivier, Yves, Robson, John Michael, Saheb-Djahromi, Nasser, Zemmari, Akka

Contributors: Zemmari, Akka, Métivier, Yves

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, Zemmari, Akka

Contributors: Métivier, Yves, Zemmari, Akka

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

On the time and the bit complexity of distributed randomised anonymous ring colouring

Authors: Métivier, Y., Robson, J.M., Saheb-Djahromi, N., Zemmari, A. ^⁎

Source: In Theoretical Computer Science 2 September 2013 502:64-75

On the distributed complexity of large-scale graph computations

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

Contributors: Pandurangan, G., Robinson, P., Scquizzato, M.

Subject Terms: Distributed graph algorithm, Lower bound, PageRank, Triangle enumeration

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:000688043500005; volume:8; issue:2; firstpage:1; lastpage:28; numberofpages:28; journal:ACM TRANSACTIONS ON PARALLEL COMPUTING; https://hdl.handle.net/11577/3399290

Availability: https://hdl.handle.net/11577/3399290
https://doi.org/10.1145/3460900

Node-Disjoint Multipath Spanners and their Relationship with Fault-Tolerant Spanners

Authors: Gavoille, Cyril, Godfroy, Quentin, Viennot, Laurent

Contributors: Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS), Algorithmics for computationally intensive applications over wide scale distributed platforms (CEPAGE), Université Sciences et Technologies - Bordeaux 1 (UB)-Centre Inria de l'Université de Bordeaux, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS), Institut universitaire de France (IUF), Ministère de l'Education nationale, de l’Enseignement supérieur et de la Recherche (M.E.N.E.S.R.), Networks, Graphs and Algorithms (GANG), Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA), Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS)-Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS)-Inria Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), European Project: 258307,EC:FP7:ICT,FP7-ICT-2009-5,EULER(2010)

Source: https://hal.science/hal-00622915 ; 2011.

Subject Terms: distributed graph algorithm, spanner, multipath routing, G.2.2 Graph Theory, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]

Relation: info:eu-repo/semantics/altIdentifier/arxiv/1109.2696; info:eu-repo/grantAgreement/EC/FP7/258307/EU/Experimental UpdateLess Evolutive Routing/EULER; ARXIV: 1109.2696

Availability: https://hal.science/hal-00622915
https://hal.science/hal-00622915v2/document
https://hal.science/hal-00622915v2/file/a.pdf