Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs (Q3608864)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs |
scientific article |
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
