On cycle cones and polyhedra (Q5895283): Difference between revisions
From MaRDI portal
Latest revision as of 12:51, 21 June 2024
scientific article; zbMATH DE number 4176832
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On cycle cones and polyhedra |
scientific article; zbMATH DE number 4176832 |
Statements
On cycle cones and polyhedra (English)
0 references
1989
0 references
Several variants of the weighted girth problem, some of which are NP-hard and some of which are solvable in polynomial time, and the polyhedra associated with each of these problems are considered. A polynomial decomposition-based algorithm for the weighted girth problem on Halin graphs is also described.
0 references
weighted girth problem
0 references
polynomial decomposition-based algorithm
0 references
Halin graphs
0 references
0 references
