Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Ephraim Korach, Michal Penn. A Fast Algorithm for Maximum Integral Two-Commodity Flow in Planar Graphs. Discrete Applied Mathematics, 47(1):77-83, 1993. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Polynomial Algorithms for (integral) Maximum Two-flows in Vertex Edge-capacitated Planar GraphsFrieda Granot, Michal Penn. DAM, 70(3):267-283, 1996. [doi] An extended planar algorithm for maximum integral two-flowRaanan Manor, Michal Penn. networks, 32(1):67-76, 1998. [doi] On the (integral) maximum tw flow in vertex and edge capacitated planar graphsFrieda Granot, Michal Penn. ipco 1993: 235-249
The following publications are possibly variants of this publication: