Parallel Algorithms with Optimal Speedup for Bounded Treewidth (Q4210129)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Parallel Algorithms with Optimal Speedup for Bounded Treewidth |
scientific article; zbMATH DE number 1200771
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel Algorithms with Optimal Speedup for Bounded Treewidth |
scientific article; zbMATH DE number 1200771 |
Statements
Parallel Algorithms with Optimal Speedup for Bounded Treewidth (English)
0 references
21 September 1998
0 references
graph algorithms
0 references
parallel algorithms
0 references
treewidth
0 references
tree decomposition
0 references
monadic second-order logic
0 references
graph reduction
0 references
derandomization
0 references
pathwidth
0 references
partial \(k\)-trees
0 references
0.9998884201049804
0 references
0.922513782978058
0 references
0.8776673674583435
0 references
