scientific article; zbMATH DE number 431512

MaRDI QIDQ3138288zbMATH OpenFDO

Authors Samir Khuller, Joseph (Seffi) Naor

Publication date 29 November 1994

zbMATH Keywords

network flowplanar graphscirculationmin-cut

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Paths and cycles (05C38)

Recommendations

• Flow in planar graphs with vertex capacities
• Flow in Planar Graphs with Multiple Sources and Sinks
• Publication:4860304
• Maximum Flow in Directed Planar Graphs with Vertex Capacities
• Maximum flow in directed planar graphs with vertex capacities

Cited in

(8)

• Some flow-equivalent planar and non-planar graphs
• Minimum cuts and shortest cycles in directed planar graphs via noncrossing shortest paths
• Flow equivalent trees in undirected node-edge-capacitated planar graphs
• Flow in planar graphs with vertex capacities
• A near-linear approximation scheme for multicuts of embedded graphs with a fixed number of terminals
• Flow-Cut Gaps and Face Covers in Planar Graphs
• The Lattice Structure of Flow in Planar Graphs
• Boundary-to-Boundary Flows in Planar Graphs

This page was built for publication:

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