An efficient algorithm for packing cuts and \((2,3)\)-metrics in a planar graph with three holes (Q2010919)
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: An efficient algorithm for packing cuts and (2,3)-metrics in a planar graph with three holes |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8469555974006653
0 references
0.8453995585441589
0 references
0.8178747892379761
0 references
0.8137474060058594
0 references
0.8018622398376465
0 references
