<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="en"><front><journal-meta><journal-id journal-id-type="publisher-id">donstu</journal-id><journal-title-group><journal-title xml:lang="en">Advanced Engineering Research (Rostov-on-Don)</journal-title><trans-title-group xml:lang="ru"><trans-title>Advanced Engineering Research (Rostov-on-Don)</trans-title></trans-title-group></journal-title-group><issn pub-type="epub">2687-1653</issn><publisher><publisher-name>Don State Technical University</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">donstu-1219</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>MANAGEMENT, COMPUTER FACILITIES AND INFORMATICS</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>УПРАВЛЕНИЕ, ВЫЧИСЛИТЕЛЬНАЯ ТЕХНИКА И ИНФОРМАТИКА</subject></subj-group></article-categories><title-group><article-title>On the flow peculiarity in network with barrier reachability</article-title><trans-title-group xml:lang="ru"><trans-title>ОБ ОСОБЕННОСТЯХ ПОТОКА В СЕТЯХ С БАРЬЕРНОЙ ДОСТИЖИМОСТЬЮ</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>ВОДОЛАЗОВ</surname><given-names>НИКОЛАЙ НИКОЛАЕВИЧ</given-names></name><name name-style="western" xml:lang="en"><surname>VODOLAZOV</surname><given-names>N.N.</given-names></name></name-alternatives><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Южный федеральный университет.</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Southern Federal University.</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2008</year></pub-date><pub-date pub-type="epub"><day>30</day><month>06</month><year>2008</year></pub-date><volume>8</volume><issue>2</issue><fpage>127</fpage><lpage>136</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; VODOLAZOV N., 2008</copyright-statement><copyright-year>2008</copyright-year><copyright-holder xml:lang="ru">ВОДОЛАЗОВ Н.</copyright-holder><copyright-holder xml:lang="en">VODOLAZOV N.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://www.vestnik-donstu.ru/jour/article/view/1219">https://www.vestnik-donstu.ru/jour/article/view/1219</self-uri><abstract/><trans-abstract xml:lang="ru"/><kwd-group xml:lang="ru"><kwd>СЕТЬ</kwd><kwd>ИСТОЧНИК</kwd><kwd>СТОК</kwd><kwd>ПОТОК</kwd><kwd>БЛОКИРУЮЩИЙ ПОТОК</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Ерусалимский Я.М., Скороходов В.А. Потоки в сетях со связанными дугами./Я.М.Ерусалимский, В.А.Скороходов.//Изв. вузов. Сев.-Кав. регион. Естественные науки, 2003; прил. № 8. -С. 9-12.</mixed-citation><mixed-citation xml:lang="en">Ерусалимский Я.М., Скороходов В.А. Потоки в сетях со связанными дугами./Я.М.Ерусалимский, В.А.Скороходов.//Изв. вузов. Сев.-Кав. регион. Естественные науки, 2003; прил. № 8. -С. 9-12.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Edmonds Jack, Karp Richard M. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems.//Journal of the Association for Computing Machinery. -Vol. 19. -No. 2, April 1972, -P. 248-264.</mixed-citation><mixed-citation xml:lang="en">Edmonds Jack, Karp Richard M. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems.//Journal of the Association for Computing Machinery. -Vol. 19. -No. 2, April 1972, -P. 248-264.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Ning Xuanxi, Ning Angelika The Blocking Flow Theory and its Application to Hamiltonian Graph Problems. Germany,Aachen: Shaker Verlag GmbH, 2006. -249p.</mixed-citation><mixed-citation xml:lang="en">Ning Xuanxi, Ning Angelika The Blocking Flow Theory and its Application to Hamiltonian Graph Problems. Germany,Aachen: Shaker Verlag GmbH, 2006. -249p.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
