A fast algorithm for minimum weight odd circuits and cuts in planar graphs (Q813970)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast algorithm for minimum weight odd circuits and cuts in planar graphs |
scientific article |
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
