Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs (Q3754451)
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: Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs |
scientific article; zbMATH DE number 4001890
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs |
scientific article; zbMATH DE number 4001890 |
Statements
Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs (English)
0 references
1986
0 references
graph decomposition
0 references
selection algorithms
0 references
uncapacitated plant location
0 references
biconnected series-parallel multigraphs
0 references
binary decomposition tree
0 references
single source shortest path problem
0 references
0 references
0.7810412645339966
0 references
0.7779332399368286
0 references
0.7719107270240784
0 references
0.7690132856369019
0 references
