A strengthened analysis of an algorithm for dominating set in planar graphs (Q415281): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C69 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C10 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6033763 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
dominating set | |||
| Property / zbMATH Keywords: dominating set / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
planar graph | |||
| Property / zbMATH Keywords: planar graph / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
parameterized complexity | |||
| Property / zbMATH Keywords: parameterized complexity / rank | |||
Normal rank | |||
Revision as of 19:29, 29 June 2023
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
