Realization of maximum flow in DTN and application in CGR

C Li, H Li, T Wu, L Yan, S Cao - Ad Hoc Networks, 2024 - Elsevier
The maximum flow problem based on a contact graph in Delay-Tolerant Networking (DTN)
is very important for routing and data planning. Common deterministic algorithms employing …
被引用次数：1 相关文章

Realization of maximum flow in DTN and application in CGR

C Li, H Li, T Wu, L Yan, S Cao - 2024 - dl.acm.org
The maximum flow problem based on a contact graph in Delay-Tolerant Networking (DTN)
is very important for routing and data planning. Common deterministic algorithms employing …