\(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth (Q972341)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth |
scientific article |
Statements
\(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth (English)
0 references
25 May 2010
0 references
algorithms
0 references
graphs
0 references
parameterized
0 references
independent set
0 references
rank-width
0 references
