Minimum convex piecewise linear cost tension problem on quasi-\(k\) series-parallel graphs (Q1775289): 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.1007/s10288-004-0049-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1995845603 / rank | |||
Normal rank | |||
Revision as of 02:41, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum convex piecewise linear cost tension problem on quasi-\(k\) series-parallel graphs |
scientific article |
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
