Pages that link to "Item:Q2445394"

The following pages link to A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs (Q2445394):

Displaying 11 items.

• Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs (Q501664) (← links)
• A local approximation algorithm for minimum dominating set problem in anonymous planar networks (Q748117) (← links)
• Distributed \(\mathcal{CONGEST}_{B C}\) constant approximation of MDS in bounded genus graphs (Q1711828) (← links)
• Compact distributed certification of planar graphs (Q2037111) (← links)
• Local planar domination revisited (Q2097345) (← 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)
• Distributed approximation algorithms for \(k\)-dominating set in graphs of bounded genus and linklessly embeddable graphs (Q2290639) (← links)
• Distributed Dominating Set Approximations beyond Planar Graphs (Q4972685) (← links)
• The energy complexity of diameter and minimum cut computation in bounded-genus networks (Q6199403) (← links)