On two techniques of combining branching and treewidth (Q1022343): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00453-007-9133-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2154399201 / rank | |||
Normal rank | |||
Revision as of 21:37, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On two techniques of combining branching and treewidth |
scientific article |
Statements
On two techniques of combining branching and treewidth (English)
0 references
22 June 2009
0 references
exact exponential time algorithms
0 references
parameterized algorithms
0 references
NP hard problems
0 references
treewidth
0 references
\#3-Coloring
0 references
\#minimum dominating set
0 references
minimum maximal matching
0 references
\(k\)-Weighted vertex cover
0 references
