Výsledky vyhľadávania - "Distributed graph algorithm"

Tight bounds on the message complexity of distributed tree verification

Autori: Kutten, Shay Robinson, Peter Tan, Ming Ming a ďalší

Prispievatelia: Kutten, Shay Robinson, Peter Tan, Ming Ming a ďalší

Zdroj: Distributed Computing. 38:113-130

Predmety: 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

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2401.11991
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2023.26

Dynamic Maximal Matching in Clique Networks

Autori: Li, Minming Robinson, Peter Zhu, Xianbin a ďalší

Prispievatelia: Li, Minming Robinson, Peter Zhu, Xianbin a ďalší

Predmety: 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

Popis súboru: application/pdf

Prístupová URL adresa: 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

Autori: Dufoulon, Fabien Pai, Shreyas Pandurangan, Gopal a ďalší

Prispievatelia: Dufoulon, Fabien Pai, Shreyas Pandurangan, Gopal a ďalší

Predmety: Distributed graph algorithm, message complexity, distributed approximation

Popis súboru: 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

Dostupnosť: 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

Autori: Kutten, Shay Robinson, Peter Tan, Ming Ming a ďalší

Prispievatelia: Kutten, Shay Robinson, Peter Tan, Ming Ming a ďalší

Predmety: Distributed Graph Algorithm, Lower Bound

Popis súboru: 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

Dostupnosť: 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

The Message Complexity of Distributed Graph Optimization

Autori: Dufoulon, Fabien Pai, Shreyas Pandurangan, Gopal a ďalší

Prispievatelia: Dufoulon, Fabien Pai, Shreyas Pandurangan, Gopal a ďalší

Predmety: 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

Popis súboru: application/pdf

Prístupová URL adresa: 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

Autori: Robinson, Peter Peter Robinson

Prispievatelia: Robinson, Peter Peter Robinson

Predmety: Distributed graph algorithm, streaming, ddc:004, graph sketching

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.32

Low diameter graph decompositions by approximate distance computation

Autori: Becker R. Emek Y. Lenzen C. a ďalší

Prispievatelia: Becker R. Emek Y. Lenzen C. a ďalší

Predmety: (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

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

Distributed algorithms for low stretch spanning trees

Autori: Becker R. Emek Y. Ghaffari M. a ďalší

Prispievatelia: Becker R. Emek Y. Ghaffari M. a ďalší

Predmety: 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

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

A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching

Autori: Naoki KITAMURA Taisuke IZUMI

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

Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions

Autori: Becker, Ruben Emek, Yuval Ghaffari, Mohsen a ďalší

Prispievatelia: Becker, Ruben Emek, Yuval Ghaffari, Mohsen a ďalší

Predmety: 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

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

About randomised distributed graph colouring and graph partition algorithms

Autori: Métivier, Yves Robson, John Michael Saheb-Djahromi, Nasser a ďalší

Prispievatelia: Métivier, Yves Robson, John Michael Saheb-Djahromi, Nasser a ďalší

Zdroj: Information and Computation. 208:1296-1304

Predmety: 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

Prístupová URL adresa: 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

Autori: Métivier, Yves Robson, John Michael Saheb-Djahromi, Nasser a ďalší

Prispievatelia: Métivier, Yves Robson, John Michael Saheb-Djahromi, Nasser a ďalší

Zdroj: Distributed Computing. 23:331-340

Predmety: [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

Prístupová URL adresa: https://hal.science/hal-00370970v1
https://hal.science/hal-00517361v1

On the distributed complexity of large-scale graph computations

Autori: Pandurangan G. Robinson P. Scquizzato M. a ďalší

Prispievatelia: Pandurangan G. Robinson P. Scquizzato M. a ďalší

Predmety: 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

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

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

Autori: Gavoille, Cyril Godfroy, Quentin Viennot, Laurent a ďalší

Prispievatelia: Gavoille, Cyril Godfroy, Quentin Viennot, Laurent a ďalší

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

Predmety: 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

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

Fast distributed algorithms for connectivity and MST in Large Graphs

Autori: Pandurangan, Gopal Robinson, Peter Scquizzato, Michele

Prispievatelia: Pandurangan, Gopal Robinson, Peter Scquizzato, Michele

Predmety: Distributed graph algorithm, Graph connectivity, Graph sketching, Minimum spanning tree, Computational Theory and Mathematic, Hardware and Architecture, Software, Modeling and Simulation

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:000455921800004; volume:5; issue:1; firstpage:1; lastpage:22; numberofpages:22; journal:ACM TRANSACTIONS ON PARALLEL COMPUTING; https://hdl.handle.net/11577/3290299; http://dl.acm.org/citation.cfm?id=J1496&picked=prox&cfid=789649777&cftoken=14890638; http://topc.acm.org/

Dostupnosť: https://hdl.handle.net/11577/3290299
https://doi.org/10.1145/3209689
http://dl.acm.org/citation.cfm?id=J1496&picked=prox&cfid=789649777&cftoken=14890638
http://topc.acm.org/

Fast distributed algorithms for connectivity and MST in large graphs

Autori: Pandurangan, Gopal Robinson, Peter Scquizzato, Michele

Prispievatelia: Pandurangan, Gopal Robinson, Peter Scquizzato, Michele

Predmety: Distributed graph algorithm, Graph connectivity, Graph sketching, Massive graph, Minimum spanning tree, Software, Theoretical Computer Science, Hardware and Architecture

Relation: info:eu-repo/semantics/altIdentifier/isbn/9781450342100; ispartofbook:Annual ACM Symposium on Parallelism in Algorithms and Architectures; 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016; volume:11-13-; firstpage:429; lastpage:438; numberofpages:10; https://hdl.handle.net/11577/3300961

Dostupnosť: https://hdl.handle.net/11577/3300961
https://doi.org/10.1145/2935764.2935785

On the Time and the Bit Complexity of Distributed Randomised Anonymous Ring Colouring

Autori: Métivier, Yves Robson, J.M. Saheb-Djahromi, Nasser a ďalší

Prispievatelia: Métivier, Yves Robson, J.M. Saheb-Djahromi, Nasser a ďalší

Zdroj: ISSN: 1879-2294.

Predmety: Colouring, Mellin Transform, Probabilistic Analysis, Randomised Distributed Graph Algorithm, Ring, Time Complexity, bit complexity, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]

Relation: hal-00695983; https://hal.archives-ouvertes.fr/hal-00695983

Dostupnosť: https://hal.archives-ouvertes.fr/hal-00695983

An optimal bit complexity randomised distributed MIS algorithm

Autori: Métivier, Yves Robson, John Michael Saheb-Djahromi, Nasser a ďalší

Prispievatelia: Métivier, Yves Robson, John Michael Saheb-Djahromi, Nasser a ďalší

Zdroj: ISSN: 0178-2770.

Predmety: Distributed graph algorithm, randomized algorithm, maximal independent set, bit complexity, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]

Geografické téma: Piran, Slovenia

Relation: hal-00370970; https://hal.archives-ouvertes.fr/hal-00370970

Dostupnosť: https://hal.archives-ouvertes.fr/hal-00370970