Efficient Parallel Algorithms for Graphs of Bounded Tree-Width (Q4864433)
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: Efficient Parallel Algorithms for Graphs of Bounded Tree-Width |
scientific article; zbMATH DE number 845867
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient Parallel Algorithms for Graphs of Bounded Tree-Width |
scientific article; zbMATH DE number 845867 |
Statements
Efficient Parallel Algorithms for Graphs of Bounded Tree-Width (English)
0 references
20 February 1996
0 references
NP-complete problems
0 references
0.95693564
0 references
0.95693564
0 references
0.94109154
0 references
0.93617857
0 references
0.93163043
0 references
0.9281142
0 references
0.9230177
0 references
0.92122716
0 references
