Dynamic algorithms for graphs of bounded treewidth (Q1578413)
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 1496847
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dynamic algorithms for graphs of bounded treewidth |
scientific article; zbMATH DE number 1496847 |
Statements
Dynamic algorithms for graphs of bounded treewidth (English)
0 references
24 April 2001
0 references
dynamic algorithm
0 references
graph algorithm
0 references
treewidth
0 references
monadic second-order logic
0 references
path query
0 references
0.9960539937019348
0 references
0.8153687119483948
0 references
0.8085798025131226
0 references
0.791576623916626
0 references
