Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs (Q4454318)
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 2052680
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs |
scientific article; zbMATH DE number 2052680 |
Statements
Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs (English)
0 references
8 March 2004
0 references
Parallel algorithms
0 references
Analysis of algorithms
0 references
Steiner set
0 references
Steiner tree
0 references
Permutation graphs
0 references
0 references
0 references
0.845541775226593
0 references
0.8445625901222229
0 references
0.8245112895965576
0 references
0.8170301914215088
0 references
0.8162526488304138
0 references
