Pages that link to "Item:Q3824434"
From MaRDI portal
The following pages link to Parallel Symmetry-Breaking in Sparse Graphs (Q3824434):
Displaying 49 items.
- Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring (Q518926) (← links)
- Optimal parallel algorithms on planar graphs (Q582094) (← links)
- Maintaining dynamic sequences under equality tests in polylogarithmic time (Q675314) (← links)
- Greed is good: Approximating independent sets in sparse and bounded-degree graphs (Q679458) (← links)
- An efficient parallel algorithm for computing a large independent set in a planar graph (Q808288) (← links)
- Distributed algorithms for random graphs (Q888436) (← links)
- Fast deterministic distributed algorithms for sparse spanners (Q930906) (← links)
- An optimal maximal independent set algorithm for bounded-independence graphs (Q992507) (← links)
- Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition (Q992509) (← links)
- Optimal parallel 3-coloring algorithm for rooted trees and its applications (Q1186596) (← links)
- Low diameter graph decompositions (Q1316650) (← links)
- Graph theoretical issues in computer networks (Q1319540) (← links)
- A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity (Q1350189) (← links)
- Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems (Q1351004) (← links)
- A fast and efficient NC algorithm for maximal matching (Q1352118) (← links)
- Connected components in \(O(\log^{3/2}n)\) parallel time for the CREW PRAM (Q1356881) (← links)
- Efficient computation of implicit representations of sparse graphs (Q1377648) (← links)
- Best of two local models: centralized local and distributed local algorithms (Q1784947) (← links)
- The local nature of \(\Delta\)-coloring and its algorithmic applications (Q1894705) (← links)
- Pairings and related symmetry notions (Q1989479) (← links)
- Distributed algorithms for fractional coloring (Q2117704) (← links)
- Combinatorial algorithms for distributed graph coloring (Q2251151) (← links)
- Distributed coloring in sparse graphs with fewer colors (Q2335690) (← links)
- Toward more localized local algorithms: removing assumptions concerning global knowledge (Q2441787) (← links)
- Property testing of planarity in the \textsf{CONGEST} model (Q2657275) (← links)
- A fast distributed algorithm for \((\Delta+1)\)-edge-coloring (Q2664558) (← links)
- Distributed minimum vertex coloring and maximum independent set in chordal graphs (Q2672608) (← links)
- Probabilistic constructions in continuous combinatorics and a bridge to distributed algorithms (Q2684542) (← links)
- Distributed graph problems through an automata-theoretic lens (Q2689441) (← links)
- Combinatorial Algorithms for Distributed Graph Coloring (Q3095316) (← links)
- Exact Bounds for Distributed Graph Colouring (Q3460706) (← links)
- A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation (Q3460717) (← links)
- An Optimal Parallel Algorithm for Minimum Spanning Trees in Planar Graphs (Q3464472) (← links)
- Parallel algorithms with optimal speedup for bounded treewidth (Q4645184) (← links)
- On the Microscopic View of Time and Messages (Q4686647) (← links)
- A PARALLEL ALGORITHM FOR MAXIMAL MATCHING BASED ON DEPTH FIRST SEARCH (Q4820076) (← links)
- <i>o</i>(log<sup>4</sup> <i>n</i>) time parallel maximal matching algorithm using linear number of processors (Q4826117) (← links)
- A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths (Q4997313) (← links)
- (Q5002725) (← links)
- Improved Dynamic Graph Coloring (Q5009642) (← links)
- Neighborhood graphs and distributed Δ+1-coloring (Q5054815) (← links)
- (Q5090456) (← links)
- Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs (Q5092380) (← links)
- Some simple distributed algorithms for sparse networks (Q5138354) (← links)
- An efficient distributed algorithm for constructing small dominating sets (Q5138380) (← links)
- Improved distributed algorithms for coloring interval graphs with application to multicoloring trees (Q5919420) (← links)
- Making local algorithms wait-free: the case of ring coloring (Q5920224) (← links)
- More Efficient Parallel Integer Sorting (Q6114876) (← links)
- Local Hadwiger's conjecture (Q6170795) (← links)
