RO EN
Algorithms for minimum flows
Authors: Eleonor Ciurea, Laura Ciupal
Keywords: Flow, network algorithms, minimum flow, preflow, residual capacity, distance label
AMS Mathematics Subject Classification: 90B10, 90C35, 05C35, 68R10
– 0.15 Mb
Keywords: Flow, network algorithms, minimum flow, preflow, residual capacity, distance label
Abstract
We present a generic preflow algorithm and several implementations of it, that solve the minimum flow problem in O(n2m) time.AMS Mathematics Subject Classification: 90B10, 90C35, 05C35, 68R10
Eleonor Ciurea, Laura Ciupal,
"Transilvania" University,
Brasov, Romania
"Transilvania" University,
Brasov, Romania
Fulltext
– 0.15 Mb
Contents
- Algorithms for minimum flows
- A sensitivity measure of the Pareto set in a vector linfnity-extreme combinatorial problem
- Extremal gaps in BP3-designs
- The Multiobjective Bottleneck Transportation Problem
- Genetic algorithms for the synthesis optimization of a set of irredundant diagnostic tests in the intelligent system
- T-invariants for jumping Petri nets
- Non-commutative computer algebra and molecular computing
- Ekaterina Logvinovna Yushchenko (a tribute in her memory)
