Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs (Q4454318): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:04, 7 February 2024
scientific article; zbMATH DE number 2052680
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
