The article presents a method for determining the maximum flow value in dynamic networks using periodic graphs. These networks are generalized networks that have a wide range of practical applications, such as water distribution, currency exchange, and transportation of perishable or valuable goods. Due to the variation in bandwidth values in different areas of the network, dynamic networks are used. These parameters are presented in a fuzzified form, accounting for environmental factors and human activities. The selection of periodic graphs is based on the presence of cycles and frequency of time intervals. These types of networks can be applied in real-world transportation scenarios.
No takes yet. Share an insight, caveat, or question.
Bozhenyuk et al. (2024) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: