Pages that link to "Item:Q3540222"
From MaRDI portal
The following pages link to Fast Distributed Approximations in Planar Graphs (Q3540222):
Displaying 39 items.
- Distributed minimum dominating set approximations in restricted families of graphs (Q360271) (← links)
- Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs (Q501664) (← links)
- Analysing local algorithms in location-aware quasi-unit-disk graphs (Q642985) (← links)
- Distributed algorithms for covering, packing and maximum weighted matching (Q661048) (← links)
- Local approximability of max-min and min-max linear programs (Q693753) (← links)
- A local approximation algorithm for minimum dominating set problem in anonymous planar networks (Q748117) (← links)
- Distributed independent sets in interval and segment intersection graphs (Q831804) (← links)
- A simple local 3-approximation algorithm for vertex cover (Q987844) (← links)
- An optimal maximal independent set algorithm for bounded-independence graphs (Q992507) (← links)
- Node labels in local decision (Q1625609) (← links)
- Linear-in-\(\varDelta \) lower bounds in the LOCAL model (Q1689747) (← links)
- Computing large independent sets in a single round (Q1699422) (← links)
- Distributed \(\mathcal{CONGEST}_{B C}\) constant approximation of MDS in bounded genus graphs (Q1711828) (← links)
- Best of two local models: centralized local and distributed local algorithms (Q1784947) (← links)
- Almost stable matchings by truncating the Gale-Shapley algorithm (Q1959728) (← links)
- Compact distributed certification of planar graphs (Q2037111) (← links)
- Local certification of graphs with bounded genus (Q2104916) (← links)
- Constant round distributed domination on graph classes with bounded expansion (Q2117740) (← links)
- Distributed distance domination in graphs with no \(K_{2,t}\)-minor (Q2143127) (← links)
- No sublogarithmic-time approximation scheme for bipartite vertex cover (Q2256970) (← links)
- Distributed approximation algorithms for \(k\)-dominating set in graphs of bounded genus and linklessly embeddable graphs (Q2290639) (← links)
- A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs (Q2445394) (← links)
- Property testing of planarity in the \textsf{CONGEST} model (Q2657275) (← links)
- Distributed minimum vertex coloring and maximum independent set in chordal graphs (Q2672608) (← links)
- Exact Bounds for Distributed Graph Colouring (Q3460706) (← links)
- Leveraging Linial’s Locality Limit (Q3540245) (← links)
- Distributed Dominating Set Approximations beyond Planar Graphs (Q4972685) (← links)
- Distributed Approximation Algorithms for the Minimum Dominating Set in K_h-Minor-Free Graphs (Q5091012) (← links)
- Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs (Q5092380) (← links)
- Local approximation of the maximum cut in regular graphs (Q5918122) (← links)
- Weak models of distributed computing, with connections to modal logic (Q5918244) (← links)
- Distributed distance-\(r\) covering problems on sparse high-girth graphs (Q5918492) (← links)
- Distributed distance-\(r\) covering problems on sparse high-girth graphs (Q5925671) (← links)
- Deterministic Massively Parallel Connectivity (Q6069413) (← links)
- The energy complexity of diameter and minimum cut computation in bounded-genus networks (Q6148068) (← links)
- The energy complexity of diameter and minimum cut computation in bounded-genus networks (Q6199403) (← links)
- The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs (Q6202219) (← links)
- Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications (Q6202221) (← links)
- Brief Announcement: Local Problems in the SUPPORTED Model (Q6202241) (← links)