A Fast Algorithm For Finding A Maximum Free Multiflow In An Inner Eulerian Network And Some Generalizations

Toshihide Ibaraki, Alexander V. Karzanov, Hiroshi Nagamochi. A Fast Algorithm For Finding A Maximum Free Multiflow In An Inner Eulerian Network And Some Generalizations. Combinatorica, 18(1):61-83, 1998. [doi]

@article{IbarakiKN98,
  title = {A Fast Algorithm For Finding A Maximum Free Multiflow In An Inner Eulerian Network And Some Generalizations},
  author = {Toshihide Ibaraki and Alexander V. Karzanov and Hiroshi Nagamochi},
  year = {1998},
  url = {http://link.springer.de/link/service/journals/00493/bibs/8018001/80180061.htm},
  researchr = {https://researchr.org/publication/IbarakiKN98},
  cites = {0},
  citedby = {0},
  journal = {Combinatorica},
  volume = {18},
  number = {1},
  pages = {61-83},
}