2011/12/03 by Ulrich Pferschy, Joachim Schauer · 1 citation
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Algorithm #Combinatorics #Complexity and Algorithms in Graphs #Digraph #Discrete mathematics #Disjoint sets #Flow (mathematics) #Graph #Mathematics #Maximum flow problem #Theory of computation #Vehicle Routing Optimization Methods
paper · doi:10.1007/s10878-011-9438-7
crossref issued 2011/12/03 · crossref published 2011/12/03 · crossref published-online 2011/12/03 · openalex publication_date 2011/12/03 · crossref created 2011/12/03 · crossref published-print 2013/07/01 · crossref deposited 2019/06/20 · openalex created_date 2025/10/10 · crossref indexed 2026/07/31 · openalex updated_date 2026/08/01