Better Polynomial Algorithms on Graphs of Bounded Rank-Width (Q3651552)
From MaRDI portal
 | This is a page for a Wikibase entity. It is used by other Wikibase pages, but it is generally not meant to be viewed directly. See Better Polynomial Algorithms on Graphs of Bounded Rank-Width for the user view. |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Better Polynomial Algorithms on Graphs of Bounded Rank-Width |
scientific article |
Statements
Better Polynomial Algorithms on Graphs of Bounded Rank-Width (English)
0 references
11 December 2009
0 references
rank-width
0 references
rank-decomposition
0 references
chromatic number
0 references
chromatic polynomial
0 references
Hamiltonian path
0 references
pseudopolynomial algorithms
0 references
