2005•Applied Mathematics and ComputationRequires access

A new approach for computing a most positive cut using the minimum flow algorithms

Mehdi Ghiyasvand

Open publisher page 6 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Minimum-cost flow problem, Maximum flow problem, Multi-commodity flow problem, Flow network, Minimum cut, Out-of-kilter algorithm, Flow (mathematics), Algorithm