Linear time algorithms for finding a dominating set of fixed size in degenerated graphs (Q1040646)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5638415
| 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 5638415 |
Statements
Linear time algorithms for finding a dominating set of fixed size in degenerated graphs (English)
0 references
25 November 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.8065531849861145
0 references
0.8046444058418274
0 references
0.7859934568405151
0 references
