MPI-INF Logo

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 6 documents:

  1. An analysis of the highest-level selection rule in the preflow-push max-flow algorithm
    Joseph Cheriyan and Kurt Mehlhorn
    Information Processing Letters 69 (5): 239-242, 1999

  2. Algorithms for Dense Graphs and Networks on the Random Access Computer
    Joseph Cheriyan and Kurt Mehlhorn
    Algorithmica 15 (5): 521-549, 1996

  3. An o(n³)-Time Maximum-Flow-Algorithm: Can a Maximum Flow be Computed in o(nm) Time?
    Joseph Cheriyan, Torben Hagerup, and Kurt Mehlhorn
    SIAM Journal on Computing 25 (6): 1144-1170, 1996
  4. A Randomized Maximum-Flow Algorithm
    Joseph Cheriyan and Torben Hagerup
    SIAM Journal on Computing 24 (2): 203-226, 1995
  5. Can a maximum flow be computed in $o(nm)$ time?
    Joseph Cheriyan, Torben Hagerup, and Kurt Mehlhorn
    Universität des Saarlandes, Saarbrücken, 90/07
    [PDF: Download: MaxFlowICALP90.pdf]
  6. Can A Maximum Flow be Computed in o(nm) Time?
    Joseph Cheriyan, Torben Hagerup, and Kurt Mehlhorn
    In: Automata, languages and programming (ICALP-90) : 17th international colloquium, Warwick University, England, 1990, 235-248