Výsledky vyhledávání - "Distributed graph algorithm"

Tight bounds on the message complexity of distributed tree verification

Autoři: Kutten, Shay Robinson, Peter Tan, Ming Ming a další

Přispěvatelé: Kutten, Shay Robinson, Peter Tan, Ming Ming a další

Zdroj: Distributed Computing. 38:113-130

Témata: 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 souboru: application/pdf

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

An Examination of a Symmetric Memory Model's Impact on Performance in a Distributed Graph Algorithm

Autoři: Ing, Michael C

Témata: University of Pittsburgh ETD, PeerReviewed

URL: http://d-scholarship.pitt.edu/40405/1/ingmc_etdPitt2021.pdf
http://worldcat.org/search?q=on:PIT+http://d-scholarship.pitt.edu/cgi/oai2+DCG_ENTIRE_REPOSITORY+CNTCOLL
http://d-scholarship.pitt.edu/40405/
http://d-scholarship.pitt.edu/40405

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

Autoři: Qirong Ho Wenqing Lin Eran Shaham a další

Zdroj: Proceedings of the 25th ACM International on Conference on Information and Knowledge Management. :1353-1362

Témata: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Přístupová URL adresa: http://dblp.uni-trier.de/db/conf/cikm/cikm2016.html#HoLSKDWZS16
https://dblp.uni-trier.de/db/conf/cikm/cikm2016.html#HoLSKDWZS16
https://dl.acm.org/citation.cfm?id=2983354

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

Autoři: Carl Tropper Azzedine Boukerche

Zdroj: IEEE Transactions on Parallel and Distributed Systems. 9:748-757

Témata: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Přístupová URL adresa: https://dblp.uni-trier.de/db/journals/tpds/tpds9.html#BoukercheT98
https://ieeexplore.ieee.org/document/706047/
https://dl.acm.org/doi/10.1109/71.706047

A Distributed Graph Algorithm for Geometric Routing in Ad Hoc Wireless Networks

Autoři: Rashid Bin Muhammad

Zdroj: Journal of Networks. 2

Témata: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Přístupová URL adresa: https://dblp.uni-trier.de/db/journals/jnw/jnw2.html#Muhammad07
https://doi.org/10.4304/jnw.2.6.50-57

A Message-Optimal Distributed Graph Algorithm: Partial Precedence Constrained Scheduling

Autoři: Chaudhuri,Pranay Thompson,Hussein

Zdroj: JUCS-Journal of Universal Computer Science 10(2): 106-119

Témata: distributed algorithm, task, 0202 electrical engineering, electronic engineering, information engineering, scheduling, 0102 computer and information sciences, 02 engineering and technology, directed graph, 01 natural sciences, precedence constraints

Popis souboru: text/html

A Distributed Graph Algorithm: Knot Detection: A distributed graph algorithm: Knot detection

Autoři: Jayadev Misra K. M. Chandy

Zdroj: ACM Transactions on Programming Languages and Systems. 4:678-686

Témata: distributed algorithms, message communication, network operating systems, network of processes, Graph theory (including graph drawing) in computer science, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, deadlock detection, 01 natural sciences, Theory of operating systems

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/3770970
https://doi.org/10.1145/69622.357190
https://dl.acm.org/doi/abs/10.1145/69622.357190
https://dblp.uni-trier.de/db/journals/toplas/toplas4.html#MisraC82a
https://cs.mcgill.ca/~carl/distknotdetecchandymisra.pdf

Dynamic Maximal Matching in Clique Networks

Autoři: Li, Minming Robinson, Peter Zhu, Xianbin a další

Přispěvatelé: Li, Minming Robinson, Peter Zhu, Xianbin a další

Témata: 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 souboru: application/pdf

Pří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

Autoři: Dufoulon, Fabien Pai, Shreyas Pandurangan, Gopal a další

Přispěvatelé: Dufoulon, Fabien Pai, Shreyas Pandurangan, Gopal a další

Témata: Distributed graph algorithm, message complexity, distributed approximation

Popis souboru: 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

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

Autoři: Kutten, Shay Robinson, Peter Tan, Ming Ming a další

Přispěvatelé: Kutten, Shay Robinson, Peter Tan, Ming Ming a další

Témata: Distributed Graph Algorithm, Lower Bound

Popis souboru: 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

Dostupnost: 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 General Distributed Graph Algorithm for Fair Access to Critical Sections

Autoři: Horst F. Wedde

Zdroj: Distributed Algorithms on Graphs ISBN: 9780773573475

The Message Complexity of Distributed Graph Optimization

Autoři: Dufoulon, Fabien Pai, Shreyas Pandurangan, Gopal a další

Přispěvatelé: Dufoulon, Fabien Pai, Shreyas Pandurangan, Gopal a další

Témata: 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 souboru: application/pdf

Pří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

Autoři: Robinson, Peter Peter Robinson

Přispěvatelé: Robinson, Peter Peter Robinson

Témata: Distributed graph algorithm, streaming, ddc:004, graph sketching

Popis souboru: application/pdf

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

A Distributed Graph Algorithm: Knot Detection.

Autoři: TEXAS UNIV AT AUSTIN DEPT OF COMPUTER SCIENCES Misra,J Chandy,K M

Zdroj: DTIC AND NTIS

Témata: Theoretical Mathematics, Non-radio Communications, ALGORITHMS, GRAPHS, MESSAGE PROCESSING, BUFFERS, DETECTION, TREES, COMMUNICATIONS NETWORKS, Knot detection, Trees(Mathematics), Deadlock detection, WUAFOSR2304A2, PE61102F, Text

URL: https://apps.dtic.mil/docs/citations/ADA120126

A Distributed Graph Algorithm: Knot Detection

Autoři: K. M. Chandy J. Misra

Low diameter graph decompositions by approximate distance computation

Autoři: Becker R. Emek Y. Lenzen C. a další

Přispěvatelé: Becker R. Emek Y. Lenzen C. a další

Témata: (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

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

Distributed algorithms for low stretch spanning trees

Autoři: Becker R. Emek Y. Ghaffari M. a další

Přispěvatelé: Becker R. Emek Y. Ghaffari M. a další

Témata: 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

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

A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching

Autoři: 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

Autoři: Becker, Ruben Emek, Yuval Ghaffari, Mohsen a další

Přispěvatelé: Becker, Ruben Emek, Yuval Ghaffari, Mohsen a další

Témata: 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

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

About randomised distributed graph colouring and graph partition algorithms

Autoři: Métivier, Yves Robson, John Michael Saheb-Djahromi, Nasser a další

Přispěvatelé: Métivier, Yves Robson, John Michael Saheb-Djahromi, Nasser a další

Zdroj: Information and Computation. 208:1296-1304

Témata: 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

Pří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