§ Department of Chemistry, University College London, 20 Gordon Street, London WC1H 0AJ, U.K. ∥ Laboratory of Molecular Simulation, Institut des Sciences et Ingénierie Chimiques, Valais, École ...
Abstract: Based on Storage Time Aggregated Graph (STAG) model in time-varying graph theory, we investigate the single-source-single-sink maximum flow problem in a time-varying Ad hoc network comprised ...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Download PDF Join the Discussion View in the ACM Digital Library The maximum flow problem and its generalization, the minimum-cost flow problem, are classic combinatorial graph problems that find ...
Abstract: In this paper, we investigate the maximum flow routing strategy with the service function chain (SFC) constraints in the space information networks (SINs), where a SFC consists of a specific ...
Part of the DynGraphLab — Dynamic Graph Algorithms open source framework. Developed at the Algorithm Engineering Group, Heidelberg University. Python Interface: An easy-to-use Python interface for ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results