Minimum convex piecewise linear cost tension problem on quasi-\(k\) series-parallel graphs (Q1775289)
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: Minimum convex piecewise linear cost tension problem on quasi-k series-parallel graphs |
scientific article; zbMATH DE number 2165893
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum convex piecewise linear cost tension problem on quasi-\(k\) series-parallel graphs |
scientific article; zbMATH DE number 2165893 |
Statements
Minimum convex piecewise linear cost tension problem on quasi-\(k\) series-parallel graphs (English)
0 references
6 May 2005
0 references
Minimum cost tension
0 references
two-terminal series-parallel digraph
0 references
graph decomposition
0 references
series-parallel recognition
0 references
out-of-kilter algorithm
0 references
0.903114378452301
0 references
0.7848220467567444
0 references
0.7440093755722046
0 references
0.7210264205932617
0 references
