NEW ALGORITHM FOR SOLUTION OF MAXIMUM FLOW PROBLEM

A new algorithm for detection of a maximum flow in multi-terminal network. The algorithm is based on its matrices description and execution of ternary operations in respect of matrix elements pertaining to arc capacity.  Therefore the algorithm does not require graphic network presentation. For this...

Full description

Bibliographic Details
Main Author: A. D. Korznikov
Format: Article
Language:Russian
Published: Belarusian National Technical University 2013-10-01
Series:Nauka i Tehnika
Online Access:https://sat.bntu.by/jour/article/view/235
_version_ 1811182801893982208
author A. D. Korznikov
author_facet A. D. Korznikov
author_sort A. D. Korznikov
collection DOAJ
description A new algorithm for detection of a maximum flow in multi-terminal network. The algorithm is based on its matrices description and execution of ternary operations in respect of matrix elements pertaining to arc capacity.  Therefore the algorithm does not require graphic network presentation. For this reason the programming realization of the developed algorithm is rather simple and it can be applied while solving a large scope of problems when mathematical models can be formulated in terms of a graph theory.
first_indexed 2024-04-11T09:36:38Z
format Article
id doaj.art-6ea05758ecc14dee94270723ce96c639
institution Directory Open Access Journal
issn 2227-1031
2414-0392
language Russian
last_indexed 2024-04-11T09:36:38Z
publishDate 2013-10-01
publisher Belarusian National Technical University
record_format Article
series Nauka i Tehnika
spelling doaj.art-6ea05758ecc14dee94270723ce96c6392022-12-22T04:31:35ZrusBelarusian National Technical UniversityNauka i Tehnika2227-10312414-03922013-10-01057075228NEW ALGORITHM FOR SOLUTION OF MAXIMUM FLOW PROBLEMA. D. Korznikov0Belarusian National Technical UniversityA new algorithm for detection of a maximum flow in multi-terminal network. The algorithm is based on its matrices description and execution of ternary operations in respect of matrix elements pertaining to arc capacity.  Therefore the algorithm does not require graphic network presentation. For this reason the programming realization of the developed algorithm is rather simple and it can be applied while solving a large scope of problems when mathematical models can be formulated in terms of a graph theory.https://sat.bntu.by/jour/article/view/235
spellingShingle A. D. Korznikov
NEW ALGORITHM FOR SOLUTION OF MAXIMUM FLOW PROBLEM
Nauka i Tehnika
title NEW ALGORITHM FOR SOLUTION OF MAXIMUM FLOW PROBLEM
title_full NEW ALGORITHM FOR SOLUTION OF MAXIMUM FLOW PROBLEM
title_fullStr NEW ALGORITHM FOR SOLUTION OF MAXIMUM FLOW PROBLEM
title_full_unstemmed NEW ALGORITHM FOR SOLUTION OF MAXIMUM FLOW PROBLEM
title_short NEW ALGORITHM FOR SOLUTION OF MAXIMUM FLOW PROBLEM
title_sort new algorithm for solution of maximum flow problem
url https://sat.bntu.by/jour/article/view/235
work_keys_str_mv AT adkorznikov newalgorithmforsolutionofmaximumflowproblem