A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs (Q2445394): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2013.11.008 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2078400655 / rank | |||
Normal rank | |||
Revision as of 01:03, 20 March 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
