scientific article; zbMATH DE number 7561283
From MaRDI portal
Publication:5090923
DOI10.4230/LIPIcs.DISC.2018.31MaRDI QIDQ5090923
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1805.04764
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15)
Related Items
Sublinear-time distributed algorithms for detecting small cliques and even cycles ⋮ Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications ⋮ Low-congestion shortcut and graph parameters ⋮ A distributed algorithm for finding Hamiltonian cycles in random graphs in \(O(\log n)\) time
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of deterministic PRAM simulation on distributed memory machines
- Distributed algorithms for random graphs
- Efficient PRAM simulation on a distributed memory machine
- Xheal
- The cover time of the giant component of a random graph
- Parallel Prefix Computation
- Time Bounded Random Access Machines with Parallel Processing
- Distributed Computing: A Locality-Sensitive Approach
- Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut
- Generalized Preconditioning and Undirected Minimum-Cost Flow
- An efficient parallel solver for SDD linear systems
- Distributed MST and Routing in Almost Mixing Time
- A unified approach to models of synchronous parallel machines
- Parallelism in random access machines
- A GENERAL PRAM SIMULATION SCHEME FOR CLUSTERED MACHINES
This page was built for publication:
