Search Results - "Distributed Graph Algorithms"
-
1
Authors:
Contributors:
Source: Journal of Applied and Computational Topology. 8:1069-1098
Subject Terms: combinatorial topology, FOS: Computer and information sciences, 0102 computer and information sciences, 02 engineering and technology, 2012 ACM Subject Classification Theory of computation → Distributed algorithms Distributed computing, [INFO] Computer Science [cs], 01 natural sciences, 7. Clean energy, Distributed computing, 102031 Theoretische Informatik, Computer Science - Distributed, Parallel, and Cluster Computing, 2012 ACM Subject Classification Theory of computation → Distributed algorithms Distributed computing distributed graph algorithms combinatorial topology, distributed graph algorithms, 102031 Theoretical computer science, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, Distributed, Parallel, and Cluster Computing (cs.DC), ddc:004
File Description: application/pdf
Access URL: http://arxiv.org/abs/2003.03255
https://ucrisportal.univie.ac.at/de/publications/8b94d914-dcb8-4035-a20f-89f5b9cfd352
https://dblp.uni-trier.de/db/journals/corr/corr2003.html#abs-2003-03255
https://doi.org/10.4230/LIPIcs.ICALP.2020.128
https://arxiv.org/pdf/2003.03255
http://dblp.uni-trier.de/db/journals/corr/corr2003.html#abs-2003-03255
https://drops.dagstuhl.de/opus/volltexte/2020/12535/pdf/LIPIcs-ICALP-2020-128.pdf/
https://drops.dagstuhl.de/opus/volltexte/2020/12535/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.128 -
2
Authors: et al.
Contributors: et al.
Source: Distributed Computing.
Subject Terms: primal-dual, distributed graph algorithms, two-stage stochastic optimization, ddc:004, weighted vertex cover
File Description: application/pdf
-
3
Authors: et al.
Contributors: et al.
Subject Terms: Random Walks, Distributed Graph Algorithms, Permutation Routing, ddc:004
File Description: application/pdf
-
4
Authors:
Contributors:
Subject Terms: FOS: Computer and information sciences, Common Random String, Distributed Graph Algorithms, Distributed, Parallel, and Cluster Computing, Distributed, Parallel, and Cluster Computing (cs.DC), ddc:004, Cryptographic Hardness
File Description: application/pdf
-
5
Authors: et al.
Contributors: et al.
Subject Terms: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), complexity gap, proof-labeling schemes, Computer Science - Distributed, Parallel, and Cluster Computing, distributed graph algorithms, Computer Science - Data Structures and Algorithms, Local certification, Data Structures and Algorithms (cs.DS), locally checkable proofs, Distributed, Parallel, and Cluster Computing (cs.DC), ddc:004, space complexity, Computer Science - Discrete Mathematics
File Description: application/pdf
-
6
Authors: et al.
Contributors: et al.
Subject Terms: 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
File Description: application/pdf
-
7
Authors: et al.
Source: SIAM Journal on Computing. 53:247-286
-
8
Authors: et al.
Contributors: et al.
Subject Terms: Distributed Graph Algorithms, Model-Agnostic Algorithms, Steiner Forest
File Description: application/pdf
Relation: Is Part Of LIPIcs, Volume 356, 39th International Symposium on Distributed Computing (DISC 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2025.25
-
9
Authors: et al.
Contributors: et al.
Subject Terms: Distributed graph algorithms, LOCAL model, computation with advice, locally checkable labeling problems, proof labeling schemes, locally checkable proofs, graph coloring, exponential-time hypothesis
File Description: application/pdf
Relation: Is Part Of LIPIcs, Volume 356, 39th International Symposium on Distributed Computing (DISC 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2025.12
-
10
Authors: et al.
Contributors: et al.
Subject Terms: Distributed graph algorithms, graph density computation, graph density approximation, network analysis theory
File Description: application/pdf
Relation: Is Part Of LIPIcs, Volume 327, 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2025.25
-
11
Authors: et al.
Contributors: et al.
Subject Terms: Distributed Graph Algorithms, Network Decomposition, Excluded Minor
File Description: application/pdf
Relation: Is Part Of LIPIcs, Volume 325, 16th Innovations in Theoretical Computer Science Conference (ITCS 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2025.45
-
12
Authors: et al.
Contributors: et al.
Source: SIROCCO 2024 ; https://hal.science/hal-04799381 ; SIROCCO 2024, May 2024, Vietri sul Mare, Italy. pp.83-100, ⟨10.1007/978-3-031-60603-8_5⟩
Subject Terms: k-Center clustering Distributed graph algorithms Shortest path metric, k-Center clustering, Distributed graph algorithms, Shortest path metric, [INFO]Computer Science [cs], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]
Subject Geographic: Vietri sul Mare, Italy
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2407.18031; ARXIV: 2407.18031
-
13
Authors: et al.
Contributors: et al.
Subject Terms: FOS: Computer and information sciences, Computer Science - Computational Complexity, Distributed Graph Algorithms, Computer Science - Distributed, Parallel, and Cluster Computing, Discrete Mathematics (cs.DM), Model-Agnostic Algorithms, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC), ddc:004, Computational Complexity (cs.CC), Steiner Forest, Computer Science - Discrete Mathematics
File Description: application/pdf
-
14
Authors: et al.
Contributors: et al.
Subject Terms: FOS: Computer and information sciences, exponential-time hypothesis, Distributed graph algorithms, proof labeling schemes, computation with advice, graph coloring, LOCAL model, locally checkable labeling problems, locally checkable proofs, Distributed, Parallel, and Cluster Computing, Distributed, Parallel, and Cluster Computing (cs.DC), ddc:004
File Description: application/pdf
-
15
Authors: et al.
Contributors: et al.
Subject Terms: FOS: Computer and information sciences, graph density computation, network analysis theory, Computer Science - Distributed, Parallel, and Cluster Computing, Distributed graph algorithms, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), graph density approximation, Distributed, Parallel, and Cluster Computing (cs.DC), ddc:004
File Description: application/pdf
-
16
Authors: et al.
Contributors: et al.
Subject Terms: FOS: Computer and information sciences, Network Decomposition, Distributed Graph Algorithms, Computer Science - Distributed, Parallel, and Cluster Computing, Excluded Minor, Distributed, Parallel, and Cluster Computing (cs.DC), ddc:004
File Description: application/pdf
-
17
Authors:
Contributors:
Subject Terms: Distributed graph algorithms, locality
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.26
-
18
Authors: et al.
Contributors: et al.
Subject Terms: Distributed Graph Algorithms, Local Algorithms, Coloring, Glauber Dynamics, Sampling, Markov Chains
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.13
-
19
Authors: et al.
Contributors: et al.
Source: Distributed Computing. 34:349-365
Subject Terms: FOS: Computer and information sciences, low-congestion shortcut, k-chordal graph, 0102 computer and information sciences, 02 engineering and technology, minimum spanning tree, 01 natural sciences, 68W15, Computer Science - Distributed, Parallel, and Cluster Computing, distributed graph algorithms, 0202 electrical engineering, electronic engineering, information engineering, Distributed, Parallel, and Cluster Computing (cs.DC), ddc:004, clique width
File Description: application/pdf
Access URL: https://link.springer.com/content/pdf/10.1007/s00446-021-00401-x.pdf
http://arxiv.org/abs/1908.09473
https://paperity.org/p/210041674/low-congestion-shortcut-and-graph -parameters
https://drops.dagstuhl.de/opus/volltexte/2019/11332/pdf/LIPIcs-DISC-2019-25.pdf
https://link.springer.com/article/10.1007%2Fs00446-021-00401-x
http://ui.adsabs.harvard.edu/abs/2019arXiv190809473K/abstract
https://doi.org/10.1007/s00446-021-00401-x
https://link.springer.com/content/pdf/10.1007/s00446-021-00401-x.pdf
http://arxiv.org/pdf/1908.09473.pdf
https://arxiv.org/abs/1908.09473
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.25 -
20
Authors:
Source: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing (PODC '21)
Proceedings of the 2021 ACM Symposium on Principles of Distributed ComputingSubject Terms: FOS: Computer and information sciences, Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Data Structures and Algorithms, Ball carving, Distributed graph algorithms, Network decomposition, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences
Access URL: http://arxiv.org/pdf/2102.09820
http://arxiv.org/abs/2102.09820
https://dblp.uni-trier.de/db/journals/corr/corr2102.html#abs-2102-09820
https://www.research-collection.ethz.ch/handle/20.500.11850/501447
https://doi.org/10.1145/3465084.3467933
https://www.podc.org/podc2021/list-of-accepted-papers/#31
http://hdl.handle.net/20.500.11850/501447
Full Text Finder 
Nájsť tento článok vo Web of Science