On the Complexity of Preflow-Push Algorithms for Maximum-Flow Problems - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Levent Tunçel. On the Complexity of Preflow-Push Algorithms for Maximum-Flow Problems. Algorithmica, 11(4):353-359, 1994.

@article{Tuncel94,
  title = {On the Complexity of Preflow-Push Algorithms for Maximum-Flow Problems},
  author = {Levent Tunçel},
  year = {1994},
  tags = {data-flow},
  researchr = {https://researchr.org/publication/Tuncel94},
  cites = {0},
  citedby = {0},
  journal = {Algorithmica},
  volume = {11},
  number = {4},
  pages = {353-359},
}

runs on WebDSL