Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs (Q3608864)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs |
scientific article; zbMATH DE number 5523856
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs |
scientific article; zbMATH DE number 5523856 |
Statements
Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs (English)
0 references
6 March 2009
0 references
H-minor-free graphs
0 references
degenerated graphs
0 references
dominating set problem
0 references
finding an induced cycle
0 references
fixed-parameter tractable algorithms
0 references
0.9996540546417236
0 references
0.8031700849533081
0 references
0.8013464212417603
0 references
0.7830920815467834
0 references
