Linear time algorithms for finding a dominating set of fixed size in degenerated graphs (Q1040646)
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
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
