The Problem of Finding the Maximal Multiple Flow in the Divisible Network and its Special Cases

In the article the problem of finding the maximal multiple flow in the network of any natural multiplicity k is studied. There are arcs of three types: ordinary arcs, multiple arcs and multi-arcs. Each multiple and multi-arc is a union of k linked arcs, which are adjusted with each other. The network ...

Celý popis

Podrobná bibliografia

Vydané v:	Modelirovanie i analiz informacionnyh sistem Ročník 22; číslo 4; s. 533 - 545
Hlavný autor:	Smirnov, A. V.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Yaroslavl State University 15.10.2015
Predmet:	divisible networks multiple networks multiple flows np-completeness polynomial algorithm
ISSN:	1818-1015, 2313-5417
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!