An efficient algorithm for packing cuts and \((2,3)\)-metrics in a planar graph with three holes (Q2010919)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm for packing cuts and \((2,3)\)-metrics in a planar graph with three holes |
scientific article |
Statements
An efficient algorithm for packing cuts and \((2,3)\)-metrics in a planar graph with three holes (English)
0 references
28 November 2019
0 references
\((2,3)\)-metric
0 references
shortest path
0 references
packing problem
0 references
strongly polynomial-time algorithm
0 references
planar graph
0 references
cut
0 references
