A strengthened analysis of an algorithm for dominating set in planar graphs (Q415281): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2010.10.004 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2010.10.004 / rank | |||
Normal rank | |||
Revision as of 01:14, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A strengthened analysis of an algorithm for dominating set in planar graphs |
scientific article |
Statements
A strengthened analysis of an algorithm for dominating set in planar graphs (English)
0 references
11 May 2012
0 references
dominating set
0 references
planar graph
0 references
parameterized complexity
0 references
