Pages that link to "Item:Q2010919"
From MaRDI portal
The following pages link to An efficient algorithm for packing cuts and \((2,3)\)-metrics in a planar graph with three holes (Q2010919):
Displaying 6 items.
- Packings of cuts realizing distances between certain vertices in a planar graph (Q804586) (← links)
- Paths and metrics in a planar graph with three or more holes. I: Metrics (Q1322003) (← links)
- Paths and metrics in a planar graph with three or more holes. II: Paths (Q1322004) (← links)
- Sums of cuts and bipartite metrics (Q1813228) (← links)
- Metric packing for \(K_ 3 + K_ 3\) (Q1945273) (← links)
- An $O ( | V |^2 )$ Algorithm for the Planar 3-Cut Problem (Q3689216) (← links)