A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs (Q2445394): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Fast Distributed Approximations in Planar Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lower bounds for local approximation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Distributed minimum dominating set approximations in restricted families of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Leveraging Linial’s Locality Limit / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Survey of local algorithms / rank | |||
Normal rank |
Latest revision as of 10:10, 8 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs |
scientific article |
Statements
A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs (English)
0 references
14 April 2014
0 references
approximation algorithms
0 references
distributed algorithm
0 references
local algorithm
0 references
dominating set
0 references
planar graph
0 references