Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs (Q4454318): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/0020716031000112330 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2028478987 / rank | |||
Normal rank | |||
Revision as of 22:29, 19 March 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
