Pages that link to "Item:Q4575597"
From MaRDI portal
The following pages link to An Improved Distributed Algorithm for Maximal Independent Set (Q4575597):
Displaying 50 items.
- An optimal bit complexity randomized distributed MIS algorithm (Q658666) (← links)
- Distributed independent sets in interval and segment intersection graphs (Q831804) (← links)
- Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition (Q992509) (← links)
- Computing large independent sets in a single round (Q1699422) (← links)
- A new distributed approximation algorithm for the maximum weight independent set problem (Q1793873) (← links)
- Improved distributed \(\Delta\)-coloring (Q1981630) (← links)
- Distributed reconfiguration of maximal independent sets (Q2186816) (← links)
- Graph reconstruction in the congested clique (Q2186818) (← links)
- What can be sampled locally? (Q2189170) (← links)
- Improved deterministic distributed matching via rounding (Q2189173) (← links)
- Derandomizing local distributed algorithms under bandwidth restrictions (Q2189176) (← links)
- Breaking the linear-memory barrier in \(\mathsf{MPC}\): fast \(\mathsf{MIS}\) on trees with strongly sublinear memory (Q2215966) (← links)
- Dynamic networks of finite state machines (Q2292917) (← links)
- Can we locally compute sparse connected subgraphs? (Q2399362) (← links)
- Toward more localized local algorithms: removing assumptions concerning global knowledge (Q2441787) (← links)
- New techniques and tighter bounds for local computation algorithms (Q2628795) (← links)
- A log-star distributed maximal independent set algorithm for growth-bounded graphs (Q2934330) (← links)
- Super-Fast 3-Ruling Sets. (Q2957487) (← links)
- Using Read-k Inequalities to Analyze a Distributed MIS Algorithm (Q3174932) (← links)
- An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model (Q4620411) (← links)
- A Time Hierarchy Theorem for the LOCAL Model (Q4646447) (← links)
- On the complexity of local distributed graph problems (Q4978023) (← links)
- On the probe complexity of local computation algorithms (Q5002725) (← links)
- (Delta+1) Coloring in the Congested Clique Model (Q5002850) (← links)
- Distributed set cover approximation: Primal-dual with optimal locality (Q5090914) (← links)
- Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set (Q5090921) (← links)
- Congested Clique Algorithms for Graph Spanners (Q5090933) (← links)
- When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time (Q5091165) (← links)
- Distributed Reconfiguration of Maximal Independent Sets (Q5092338) (← links)
- Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs (Q5092380) (← links)
- Network Decomposition and Distributed Derandomization (Invited Paper) (Q5100942) (← links)
- Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering (Q5112251) (← links)
- Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs (Q5115699) (← links)
- Feedback from nature (Q5176090) (← links)
- Distributed Maximal Independent Set using Small Messages (Q5236233) (← links)
- Optimal Dynamic Distributed MIS (Q5361939) (← links)
- Distributed MIS via All-to-All Communication (Q5368954) (← links)
- Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal Independent Sets (Q5855210) (← links)
- Distributed Lower Bounds for Ruling Sets (Q5863326) (← links)
- How long it takes for an ordinary node with an ordinary ID to output? (Q5916003) (← links)
- A topological perspective on distributed network algorithms (Q5919043) (← links)
- Distributed algorithms for the Lovász local lemma and graph coloring (Q5920074) (← links)
- Node and edge averaged complexities of local graph problems (Q6071120) (← links)
- Local problems on grids from the perspective of distributed algorithms, finitary factors, and descriptive combinatorics (Q6076330) (← links)
- Time-optimal construction of overlay networks (Q6096036) (← links)
- Component stability in low-space massively parallel computation (Q6126138) (← links)
- Derandomizing local distributed algorithms under bandwidth restrictions (Q6487482) (← links)
- The complexity of symmetry breaking in massive graphs (Q6487543) (← links)
- Loosely-Stabilizing Maximal Independent Set Algorithms with Unreliable Communications (Q6488445) (← links)
- Improved distributed approximations for maximum independent set (Q6535034) (← links)
