Cut-set Theorems
Cut-Set Theorems is a network theory framework that characterizes the relationships between branch currents and voltages in electrical networks by analyzing the constraints imposed by the minimal sets of branches whose removal divides the network into two disconnected subnetworks.
206
Publications
6.6K
Citations
353
Authors
215
Institutions
Publications per year
2017–2026
28
Parents
206
Odd Minimum Cut-Sets and <i>b</i>-Matchings
Manfred Padberg, M. R. Rao · Mathematics of Operations Research · 1982 · 405 citations
1–5 of 206
353
6
h-index
King Abdullah University of Science and Technology, Saudi Arabia
6 publications · 140 citations
6
h-index
6
h-index
5
h-index
4
h-index
1–5 of 353
215
Stanford University
Stanford, United States
11 h-index
20 publications
847 citations
University of California, Berkeley
Berkeley, United States
9 h-index
14 publications
948 citations

University of Waterloo
Waterloo, Canada
7 h-index
11 publications
249 citations
University of Maryland, College Park
College Park, United States
6 h-index
10 publications
221 citations

Cornell University
Ithaca, United States
5 h-index
6 publications
142 citations
California Institute of Technology
Pasadena, United States
5 h-index
9 publications
234 citations
Ruhr University Bochum
Bochum, Germany
4 h-index
8 publications
238 citations
Technical University of Munich
Munich, Germany
4 h-index
9 publications
136 citations
1–8 of 215
29 publications · 1.3K citations
18
h-index
12 publications · 290 citations
11
h-index
Repository · 7 publications · 129 citations
7
h-index
6 publications · 181 citations
6
h-index
5 publications · 332 citations
5
h-index
1–5