@inproceedings{be36761ab7f64c8585ad58f467908483,
title = "On evaluating a network throughput",
abstract = "The task of obtaining and estimating maximum flows between all pairs of nodes in a given subset of a network{\textquoteright}s nodes is discussed. It is shown how significantly reduce number of operations by re-usage of some intermediate results while calculating maximum flows between several pairs of nodes. Obtaining all maximum flows allows calculate an arithmetical average of maximum flows between all pairs of nodes characterizes “throughput” of a network in a whole that may serve as the index of a citys road network quality, for example. Cumulative bounds are used for faster and strict estimation of maximum flows and their average.",
keywords = "Graph, Maximum flow, Network throughput",
author = "Rodionov, {Alexey S.}",
year = "2019",
doi = "10.1007/978-3-030-19063-7_3",
language = "English",
isbn = "9783030190620",
series = "Advances in Intelligent Systems and Computing",
publisher = "Springer-Verlag GmbH and Co. KG",
pages = "34--41",
editor = "Hyunseung Choo and Sukhan Lee and Roslan Ismail",
booktitle = "Proceedings of the 13th International Conference on Ubiquitous Information Management and Communication, IMCOM 2019",
address = "Germany",
note = "13th International Conference on Ubiquitous Information Management and Communication, IMCOM 2019 ; Conference date: 04-01-2019 Through 06-01-2019",
}