Capacity-Preserving Subgraphs of Directed Flow Networks
| Autor(en): | Chimani, Markus Ilsen, Max |
Stichwörter: | Computer science; Directed acyclic graph; Mathematical analysis; Maximum flow problem; Discrete mathematics; Mathematics; Digraph; Combinatorics; Generalization; Time complexity; Algorithm; Directed graph | Erscheinungsdatum: | 2023 | Startseite: | 160 | Seitenende: | 172 | DOI: | https://doi.org/10.1007/978-3-031-34347-6_14 |
Zur Langanzeige
Seitenaufrufe
1
Letzte Woche
0
0
Letzter Monat
0
0
geprüft am 18.05.2024
