A fast algorithm for minimum weight odd circuits and cuts in planar graphs (Q813970)
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: A fast algorithm for minimum weight odd circuits and cuts in planar graphs |
scientific article; zbMATH DE number 5003057
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast algorithm for minimum weight odd circuits and cuts in planar graphs |
scientific article; zbMATH DE number 5003057 |
Statements
A fast algorithm for minimum weight odd circuits and cuts in planar graphs (English)
0 references
2 February 2006
0 references
combinatorial optimization
0 references
sparse graphs
0 references
