Saved in:
| Main Authors: | Dutta, Ayan, Dasgupta, Prithviraj, Nelson, Carl |
|---|---|
| Format: | Preprint |
| Published: |
2016
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/1602.03104 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
HiPerMotif: Novel Parallel Subgraph Isomorphism in Large-Scale Property Graphs
by: Dindoost, Mohammad, et al.
Published: (2025)
by: Dindoost, Mohammad, et al.
Published: (2025)
Decentralized Distributed Graph Coloring II: degree+1-Coloring Virtual Graphs
by: Flin, Maxime, et al.
Published: (2024)
by: Flin, Maxime, et al.
Published: (2024)
Distributed Stochastic Graph Algorithms
by: Censor-Hillel, Keren, et al.
Published: (2026)
by: Censor-Hillel, Keren, et al.
Published: (2026)
Distributed Graph Algorithms with Predictions
by: Boyar, Joan, et al.
Published: (2025)
by: Boyar, Joan, et al.
Published: (2025)
Location-Aware Dispersion on Anonymous Graphs
by: Himani, et al.
Published: (2026)
by: Himani, et al.
Published: (2026)
PASGAL: Parallel And Scalable Graph Algorithm Library
by: Dong, Xiaojun, et al.
Published: (2024)
by: Dong, Xiaojun, et al.
Published: (2024)
Engineering A Workload-balanced Push-Relabel Algorithm for Massive Graphs on GPUs
by: Hsieh, Chou-Ying, et al.
Published: (2024)
by: Hsieh, Chou-Ying, et al.
Published: (2024)
Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs
by: Bonamy, Marthe, et al.
Published: (2025)
by: Bonamy, Marthe, et al.
Published: (2025)
A Fast-Converging Decentralized Approach to the Weighted Minimum Vertex Cover Problem
by: Mordacchini, Matteo, et al.
Published: (2025)
by: Mordacchini, Matteo, et al.
Published: (2025)
Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
by: Blin, Lelia, et al.
Published: (2026)
by: Blin, Lelia, et al.
Published: (2026)
Dispersion is (Almost) Optimal under (A)synchrony
by: Kshemkalyani, Ajay D., et al.
Published: (2025)
by: Kshemkalyani, Ajay D., et al.
Published: (2025)
DAG-Inducing Problems and Algorithms
by: Gupta, Arya Tanmay, et al.
Published: (2023)
by: Gupta, Arya Tanmay, et al.
Published: (2023)
Eventually Lattice-Linear Algorithms
by: Gupta, Arya Tanmay, et al.
Published: (2023)
by: Gupta, Arya Tanmay, et al.
Published: (2023)
A Parallel Scan Algorithm in the Tensor Core Unit Model
by: Zouzias, Anastasios, et al.
Published: (2024)
by: Zouzias, Anastasios, et al.
Published: (2024)
A Fault-Tolerant Version of Safra's Termination Detection Algorithm
by: Fokkink, Wan, et al.
Published: (2026)
by: Fokkink, Wan, et al.
Published: (2026)
Agentic Distributed Computing
by: Kshemkalyani, Ajay D., et al.
Published: (2025)
by: Kshemkalyani, Ajay D., et al.
Published: (2025)
Improved Linear-Time Construction of Minimal Dominating Set via Mobile Agents
by: Chand, Prabhat Kumar, et al.
Published: (2025)
by: Chand, Prabhat Kumar, et al.
Published: (2025)
Optimal Dispersion Under Asynchrony
by: Pattanayak, Debasish, et al.
Published: (2025)
by: Pattanayak, Debasish, et al.
Published: (2025)
A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems
by: Li, Qian, et al.
Published: (2024)
by: Li, Qian, et al.
Published: (2024)
A $(3+\varepsilon)$-Approximate Correlation Clustering Algorithm in Dynamic Streams
by: Cambus, Mélanie, et al.
Published: (2022)
by: Cambus, Mélanie, et al.
Published: (2022)
Parallel Algorithms for Hierarchical Nucleus Decomposition
by: Shi, Jessica, et al.
Published: (2023)
by: Shi, Jessica, et al.
Published: (2023)
Encoding Schemes for Parallel In-Place Algorithms
by: Hutton, Chase, et al.
Published: (2025)
by: Hutton, Chase, et al.
Published: (2025)
Multi-Agent Online Graph Exploration on Cycles and Tadpole Graphs
by: Akker, Erik van den, et al.
Published: (2024)
by: Akker, Erik van den, et al.
Published: (2024)
BinomialHash: A Constant Time, Minimal Memory Consistent Hash Algorithm
by: Coluzzi, Massimo, et al.
Published: (2024)
by: Coluzzi, Massimo, et al.
Published: (2024)
Beyond BFS: A Comparative Study of Rooted Spanning Tree Algorithms on GPUs
by: Sahu, Abhijeet, et al.
Published: (2026)
by: Sahu, Abhijeet, et al.
Published: (2026)
Massively Parallel Algorithms for Approximate Shortest Paths
by: Dory, Michal, et al.
Published: (2024)
by: Dory, Michal, et al.
Published: (2024)
Decentralized Distributed Graph Coloring: Cluster Graphs
by: Flin, Maxime, et al.
Published: (2024)
by: Flin, Maxime, et al.
Published: (2024)
A Simple $(1-ε)$-Approximation Semi-Streaming Algorithm for Maximum (Weighted) Matching
by: Assadi, Sepehr
Published: (2023)
by: Assadi, Sepehr
Published: (2023)
Designing Parallel Algorithms for Community Detection using Arachne
by: Li, Fuhuan, et al.
Published: (2025)
by: Li, Fuhuan, et al.
Published: (2025)
Two Efficient Message-passing Exclusive Scan Algorithms
by: Träff, Jesper Larsson
Published: (2026)
by: Träff, Jesper Larsson
Published: (2026)
Almost Optimal Algorithms for Token Collision in Anonymous Networks
by: Bai, Sirui, et al.
Published: (2024)
by: Bai, Sirui, et al.
Published: (2024)
Parallel Algorithms for the One Sided Crossing Minimization Problem
by: Popa, Bogdan-Ioan, et al.
Published: (2025)
by: Popa, Bogdan-Ioan, et al.
Published: (2025)
Fully Scalable MPC Algorithms for Euclidean k-Center
by: Czumaj, Artur, et al.
Published: (2025)
by: Czumaj, Artur, et al.
Published: (2025)
Fully Scalable MPC Algorithms for Clustering in High Dimension
by: Czumaj, Artur, et al.
Published: (2023)
by: Czumaj, Artur, et al.
Published: (2023)
Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering
by: De Man, Quinten, et al.
Published: (2025)
by: De Man, Quinten, et al.
Published: (2025)
Fast and Space-Efficient Parallel Algorithms for Influence Maximization
by: Wang, Letong, et al.
Published: (2023)
by: Wang, Letong, et al.
Published: (2023)
Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering
by: Dhulipala, Laxman, et al.
Published: (2024)
by: Dhulipala, Laxman, et al.
Published: (2024)
Distributed Maximum Flow in Planar Graphs
by: Abd-Elhaleem, Yaseen, et al.
Published: (2024)
by: Abd-Elhaleem, Yaseen, et al.
Published: (2024)
Round and Communication Efficient Graph Coloring
by: Chang, Yi-Jun, et al.
Published: (2024)
by: Chang, Yi-Jun, et al.
Published: (2024)
Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications
by: Chang, Yi-Jun
Published: (2023)
by: Chang, Yi-Jun
Published: (2023)
Similar Items
-
HiPerMotif: Novel Parallel Subgraph Isomorphism in Large-Scale Property Graphs
by: Dindoost, Mohammad, et al.
Published: (2025) -
Decentralized Distributed Graph Coloring II: degree+1-Coloring Virtual Graphs
by: Flin, Maxime, et al.
Published: (2024) -
Distributed Stochastic Graph Algorithms
by: Censor-Hillel, Keren, et al.
Published: (2026) -
Distributed Graph Algorithms with Predictions
by: Boyar, Joan, et al.
Published: (2025) -
Location-Aware Dispersion on Anonymous Graphs
by: Himani, et al.
Published: (2026)