Polynomial Algorithms for Some Hard Problems of Finding Connected Spanning Subgraphs of Extreme Total Edge Weight (Q5391765)
From MaRDI portal
scientific article; zbMATH DE number 5875803
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial Algorithms for Some Hard Problems of Finding Connected Spanning Subgraphs of Extreme Total Edge Weight |
scientific article; zbMATH DE number 5875803 |
Statements
Polynomial Algorithms for Some Hard Problems of Finding Connected Spanning Subgraphs of Extreme Total Edge Weight (English)
0 references
7 April 2011
0 references
