Cut-set Bounds
Cut-Set Bounds is a fundamental limit in network information theory that characterizes the maximum achievable rate of information transfer across a network by considering the minimum capacity of all possible cuts that separate the source and destination nodes, where each cut's capacity is the sum of the capacities of the edges crossing the cut.
245
Publications
9.6K
Citations
443
Authors
248
Institutions
Publications per year
2017–2026
32
Parents
245
Odd Minimum Cut-Sets and <i>b</i>-Matchings
Manfred Padberg, M. R. Rao · Mathematics of Operations Research · 1982 · 405 citations
1–5 of 245
443
10
h-index
8
h-index
8
h-index
7
h-index
6
h-index
1–5 of 443
248
University of California, Berkeley
Berkeley, United States
15 h-index
26 publications
1.9K citations
Stanford University
Stanford, United States
15 h-index
29 publications
1.1K citations
California Institute of Technology
Pasadena, United States
10 h-index
22 publications
563 citations
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
7 h-index
8 publications
833 citations

Cornell University
Ithaca, United States
7 h-index
8 publications
206 citations
University of Maryland, College Park
College Park, United States
7 h-index
11 publications
355 citations
Princeton University
Princeton, United States
6 h-index
8 publications
429 citations
Technical University of Munich
Munich, Germany
6 h-index
12 publications
186 citations
1–8 of 248
41 publications · 2.3K citations
22
h-index
Repository · 11 publications · 212 citations
10
h-index
Repository · 7 publications · 567 citations
7
h-index
6 publications · 153 citations
6
h-index
5 publications · 169 citations
5
h-index
1–5