DOI: 10.1016/0020-0190(78)90016-9. An O(|V|3) algorithm for finding maximum flows in networks

An O(|V|3) algorithm for finding maximum flows in networks

10.1016/0020-0190(78)90016-9

Crossref journal-article

Elsevier BV

Information Processing Letters (78)

Bibliography

Malhotra, V. M., Kumar, M. P., & Maheshwari, S. N. (1978). An O(|V|3) algorithm for finding maximum flows in networks. Information Processing Letters, 7(6), 277â278.

Authors 3

V.M. Malhotra (first)
M.Pramodh Kumar (additional)
S.N. Maheshwari (additional)

References 7 Referenced 168

{'key': '10.1016/0020-0190(78)90016-9_BIB1', 'first-page': '117', 'article-title': 'Algorithm of construction of maximal flow in networks with complexity of O(|V|2·|E|12 operations', 'volume': '7', 'author': 'Cherkasky', 'year': '1977', 'journal-title': 'Math. Methods of Solution of Econ. Problems'} / Math. Methods of Solution of Econ. Problems / Algorithm of construction of maximal flow in networks with complexity of O(|V|2·|E|12 operations by Cherkasky (1977)
{'key': '10.1016/0020-0190(78)90016-9_BIB2', 'first-page': '1277', 'article-title': 'Algorithm for solution of a problem of maximum flow in a network with power estimation', 'volume': '11', 'author': 'Dinic', 'year': '1970', 'journal-title': 'Soviet Math. Dokl.'} / Soviet Math. Dokl. / Algorithm for solution of a problem of maximum flow in a network with power estimation by Dinic (1970)
{'key': '10.1016/0020-0190(78)90016-9_BIB3', 'article-title': 'The max flow algorithm of Dinic and Karzanov: An exposition', 'author': 'Even', 'year': '1976', 'journal-title': 'MIT Laboratory for Computer Science Technical Report No. MIT/LCS/TM-80'} / MIT Laboratory for Computer Science Technical Report No. MIT/LCS/TM-80 / The max flow algorithm of Dinic and Karzanov: An exposition by Even (1976)
10.1137/0204043 / SIAM J. Comput. / Network flow and testing graph connectivity by Even (1975)
{'key': '10.1016/0020-0190(78)90016-9_BIB5', 'series-title': 'Flows in Networks', 'author': 'Ford', 'year': '1962'} / Flows in Networks by Ford (1962)
{'key': '10.1016/0020-0190(78)90016-9_BIB6', 'series-title': 'A new algorithm for maximal flow problem: preliminary version', 'author': 'Galil', 'year': '1978'} / A new algorithm for maximal flow problem: preliminary version by Galil (1978)
{'key': '10.1016/0020-0190(78)90016-9_BIB7', 'first-page': '434', 'article-title': 'Determining the maximal flow in a network by the method of preflows', 'volume': '15', 'author': 'Karzanov', 'year': '1974', 'journal-title': 'Soviet Math. Dokl.'} / Soviet Math. Dokl. / Determining the maximal flow in a network by the method of preflows by Karzanov (1974)

Dates

Type	When
Created	23 years, 1 month ago (July 26, 2002, 12:11 a.m.)
Deposited	6 years, 4 months ago (April 12, 2019, 12:27 p.m.)
Indexed	4 weeks, 1 day ago (Aug. 6, 2025, 9:13 a.m.)
Issued	46 years, 11 months ago (Oct. 1, 1978)
Published	46 years, 11 months ago (Oct. 1, 1978)
Published Print	46 years, 11 months ago (Oct. 1, 1978)

Funders 0

None

BibTeX

@article{Malhotra_1978, title={An O(|V|3) algorithm for finding maximum flows in networks}, volume={7}, ISSN={0020-0190}, url={http://dx.doi.org/10.1016/0020-0190(78)90016-9}, DOI={10.1016/0020-0190(78)90016-9}, number={6}, journal={Information Processing Letters}, publisher={Elsevier BV}, author={Malhotra, V.M. and Kumar, M.Pramodh and Maheshwari, S.N.}, year={1978}, month=oct, pages={277–278} }

JSON

{
  "indexed": {
    "date-parts": [
      [
        2025,
        8,
        6
      ]
    ],
    "date-time": "2025-08-06T13:13:27Z",
    "timestamp": 1754486007701
  },
  "reference-count": 7,
  "publisher": "Elsevier BV",
  "issue": "6",
  "license": [
    {
      "start": {
        "date-parts": [
          [
            1978,
            10,
            1
          ]
        ],
        "date-time": "1978-10-01T00:00:00Z",
        "timestamp": 276048000000
      },
      "content-version": "tdm",
      "delay-in-days": 0,
      "URL": "https://www.elsevier.com/tdm/userlicense/1.0/"
    }
  ],
  "content-domain": {
    "domain": [],
    "crossmark-restriction": false
  },
  "published-print": {
    "date-parts": [
      [
        1978,
        10
      ]
    ]
  },
  "DOI": "10.1016/0020-0190(78)90016-9",
  "type": "journal-article",
  "created": {
    "date-parts": [
      [
        2002,
        7,
        26
      ]
    ],
    "date-time": "2002-07-26T04:11:21Z",
    "timestamp": 1027656681000
  },
  "page": "277-278",
  "source": "Crossref",
  "is-referenced-by-count": 168,
  "title": "An O(|V|3) algorithm for finding maximum flows in networks",
  "prefix": "10.1016",
  "volume": "7",
  "author": [
    {
      "given": "V.M.",
      "family": "Malhotra",
      "sequence": "first",
      "affiliation": []
    },
    {
      "given": "M.Pramodh",
      "family": "Kumar",
      "sequence": "additional",
      "affiliation": []
    },
    {
      "given": "S.N.",
      "family": "Maheshwari",
      "sequence": "additional",
      "affiliation": []
    }
  ],
  "member": "78",
  "reference": [
    {
      "key": "10.1016/0020-0190(78)90016-9_BIB1",
      "first-page": "117",
      "article-title": "Algorithm of construction of maximal flow in networks with complexity of O(|V|2\u00b7|E|12 operations",
      "volume": "7",
      "author": "Cherkasky",
      "year": "1977",
      "journal-title": "Math. Methods of Solution of Econ. Problems"
    },
    {
      "key": "10.1016/0020-0190(78)90016-9_BIB2",
      "first-page": "1277",
      "article-title": "Algorithm for solution of a problem of maximum flow in a network with power estimation",
      "volume": "11",
      "author": "Dinic",
      "year": "1970",
      "journal-title": "Soviet Math. Dokl."
    },
    {
      "key": "10.1016/0020-0190(78)90016-9_BIB3",
      "article-title": "The max flow algorithm of Dinic and Karzanov: An exposition",
      "author": "Even",
      "year": "1976",
      "journal-title": "MIT Laboratory for Computer Science Technical Report No. MIT/LCS/TM-80"
    },
    {
      "key": "10.1016/0020-0190(78)90016-9_BIB4",
      "doi-asserted-by": "crossref",
      "first-page": "507",
      "DOI": "10.1137/0204043",
      "article-title": "Network flow and testing graph connectivity",
      "volume": "4",
      "author": "Even",
      "year": "1975",
      "journal-title": "SIAM J. Comput."
    },
    {
      "key": "10.1016/0020-0190(78)90016-9_BIB5",
      "series-title": "Flows in Networks",
      "author": "Ford",
      "year": "1962"
    },
    {
      "key": "10.1016/0020-0190(78)90016-9_BIB6",
      "series-title": "A new algorithm for maximal flow problem: preliminary version",
      "author": "Galil",
      "year": "1978"
    },
    {
      "key": "10.1016/0020-0190(78)90016-9_BIB7",
      "first-page": "434",
      "article-title": "Determining the maximal flow in a network by the method of preflows",
      "volume": "15",
      "author": "Karzanov",
      "year": "1974",
      "journal-title": "Soviet Math. Dokl."
    }
  ],
  "container-title": "Information Processing Letters",
  "original-title": [],
  "language": "en",
  "link": [
    {
      "URL": "https://api.elsevier.com/content/article/PII:0020019078900169?httpAccept=text/xml",
      "content-type": "text/xml",
      "content-version": "vor",
      "intended-application": "text-mining"
    },
    {
      "URL": "https://api.elsevier.com/content/article/PII:0020019078900169?httpAccept=text/plain",
      "content-type": "text/plain",
      "content-version": "vor",
      "intended-application": "text-mining"
    }
  ],
  "deposited": {
    "date-parts": [
      [
        2019,
        4,
        12
      ]
    ],
    "date-time": "2019-04-12T16:27:56Z",
    "timestamp": 1555086476000
  },
  "score": 1,
  "resource": {
    "primary": {
      "URL": "https://linkinghub.elsevier.com/retrieve/pii/0020019078900169"
    }
  },
  "subtitle": [],
  "short-title": [],
  "issued": {
    "date-parts": [
      [
        1978,
        10
      ]
    ]
  },
  "references-count": 7,
  "journal-issue": {
    "issue": "6",
    "published-print": {
      "date-parts": [
        [
          1978,
          10
        ]
      ]
    }
  },
  "alternative-id": [
    "0020019078900169"
  ],
  "URL": "http://dx.doi.org/10.1016/0020-0190(78)90016-9",
  "relation": {},
  "ISSN": [
    "0020-0190"
  ],
  "subject": [],
  "container-title-short": "Information Processing Letters",
  "published": {
    "date-parts": [
      [
        1978,
        10
      ]
    ]
  }
}