Multi-commodity Flow
Multi-Commodity Flow is a network optimization problem in which a single underlying network must simultaneously route multiple distinct types of flow commodities, each with its own source, sink, and flow conservation constraints, thereby generalizing the classical single-commodity flow model to capture more complex resource distribution scenarios.
452
Publications
27.2K
Citations
1K
Authors
466
Institutions
Publications per year
2017–2026
86
Parents
452
Virtual network embedding through topology-aware node ranking
Xiang Cheng, Sen Su, Zhongbao Zhang et al. · ACM SIGCOMM Computer Communication Review · 2011 · 532 citations
1–5 of 452
1K
6
h-index
6
h-index
6
h-index
5
h-index
5
h-index
1–5 of 1K
466
Massachusetts Institute of Technology
Cambridge, United States
20 h-index
38 publications
2.5K citations

Centre National de la Recherche Scientifique
Paris, France
10 h-index
17 publications
700 citations
University of California, Berkeley
Berkeley, United States
9 h-index
15 publications
1K citations
Stanford University
Stanford, United States
8 h-index
11 publications
582 citations
Georgia Institute of Technology
Atlanta, United States
8 h-index
15 publications
531 citations
IBM (United States)
Armonk, United States
7 h-index
8 publications
475 citations
University of California San Diego
San Diego, United States
7 h-index
20 publications
781 citations
Tsinghua University
Beijing, China
7 h-index
20 publications
480 citations
1–8 of 466
21 publications · 2.1K citations
20
h-index
20 publications · 1K citations
17
h-index
19 publications · 1.5K citations
16
h-index
18 publications · 1.9K citations
14
h-index
12 publications · 881 citations
12
h-index
1–5