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 ...

Full description

Bibliographic Details

Published in:	Modelirovanie i analiz informacionnyh sistem Vol. 22; no. 4; pp. 533 - 545
Main Author:	Smirnov, A. V.
Format:	Journal Article
Language:	English
Published:	Yaroslavl State University 15.10.2015
Subjects:	divisible networks multiple networks multiple flows np-completeness polynomial algorithm
ISSN:	1818-1015, 2313-5417
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!