Exact algorithms for difficult graph problems (Q3578291)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5757687
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact algorithms for difficult graph problems |
scientific article; zbMATH DE number 5757687 |
Statements
Exakte Algorithmen für schwere Graphenprobleme (English)
0 references
19 July 2010
0 references
fixed-parameter algorithm
0 references
fast exponential time algorithm
0 references
constrained satisfaction problem
0 references
graph
0 references
treewidth
0 references
cliquewidth
0 references
decomposition
0 references
0.8136937618255615
0 references
0.8095894455909729
0 references
0.7991291880607605
0 references
