Distributed Approximation Algorithms for Planar Graphs
From MaRDI portal
(Redirected from Publication:3434565)
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Approximation algorithms (68W25)
Recommendations
Cited in
(15)- Compact distributed certification of planar graphs
- A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs
- Distributed Approximation Algorithms in Unit-Disk Graphs
- Fast Distributed Approximations in Planar Graphs
- Distributed Dominating Set Approximations beyond Planar Graphs
- Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs
- Distributed algorithms for planar networks. I: Planar embedding
- Distributed Almost Exact Approximations for Minor-Closed Families
- Distributed distance-r covering problems on sparse high-girth graphs
- Distributed distance-\(r\) covering problems on sparse high-girth graphs
- Near-optimal distributed DFS in planar graphs
- Distributed domination on sparse graph classes
- The distributed complexity of locally checkable labeling problems beyond paths and trees
- Narrowing the \textsf{LOCAL-CONGEST} gaps in sparse networks via expander decompositions
- Distributed algorithms for weighted problems in sparse graphs
This page was built for publication: Distributed Approximation Algorithms for Planar Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3434565)
