Packings of cuts realizing distances between certain vertices in a planar graph

DOI10.1016/0012-365X(90)90164-DzbMATH Open0728.05030OpenAlexW1994151155MaRDI QIDQ804586FDOQ804586

Authors Alexander V. Karzanov 

Publication date 1990

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(90)90164-d

zbMATH Keywords

distancesplanar graphcuts

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Distances and cuts in planar graphs
• An efficient algorithm for packing cuts and \((2,3)\)-metrics in a planar graph with three holes
• A note on packing paths in planar graphs
• An $O ( | V |^2 )$ Algorithm for the Planar 3-Cut Problem
• The planar multiterminal cut problem

Cites work

• scientific article; zbMATH DE number 3906192 (Why is no real title available?)
• Distances and cuts in planar graphs
• Metrics and undirected cuts
• Multicommodity flows in graphs
• On fractional multicommodity flows and distance functions

Cited in

(2)

• An efficient algorithm for packing cuts and \((2,3)\)-metrics in a planar graph with three holes
• Distances and cuts in planar graphs

This page was built for publication: Packings of cuts realizing distances between certain vertices in a planar graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804586)