Flows in Generalized Nets with Related Arcs
The problem of finding the maximum flow in nets of a special form is considered. In such nets the arcs are related in such a way that the total flow passing through the related arcs does not exceed the minimum throughput of these arcs. It is shown that the theorem by Ford and Fulkerson, according to...
Saved in:
Main Author: | V. A. Skorokhodov |
---|---|
Format: | Article |
Language: | English |
Published: |
Yaroslavl State University
2015-02-01
|
Series: | Моделирование и анализ информационных систем |
Subjects: | |
Online Access: | https://www.mais-journal.ru/jour/article/view/17 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Remarks on the Reachability Graphs of Petri Nets
by: Yuriy Anatol’yevich Belov
Published: (2022-12-01) -
CPN Tools-Assisted Simulation and Verification of Nested Petri Nets
by: L. W. Dworza´nski, et al.
Published: (2015-03-01) -
The Polynomial Algorithm of Finding the Shortest Path in a Divisible Multiple Graph
by: Alexander Valeryevich Smirnov
Published: (2022-12-01) -
The Optimized Algorithm of Finding the Shortest Path in a Multiple Graph
by: Alexander Valeryevich Smirnov
Published: (2023-04-01) -
The Shortest Path Problem for a Multiple Graph
by: Alexander V. Smirnov
Published: (2017-12-01)