A Fast Algorithm for Maximum Integral Two-Commodity Flow in Planar Graphs

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]

@article{KorachP93,
  title = {A Fast Algorithm for Maximum Integral Two-Commodity Flow in Planar Graphs},
  author = {Ephraim Korach and Michal Penn},
  year = {1993},
  doi = {10.1016/0166-218X(93)90153-F},
  url = {http://dx.doi.org/10.1016/0166-218X(93)90153-F},
  tags = {planar graph, data-flow, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/KorachP93},
  cites = {0},
  citedby = {0},
  journal = {Discrete Applied Mathematics},
  volume = {47},
  number = {1},
  pages = {77-83},
}