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

Authors

353

  1. MG
    Michael Gastpar

    University of California, Berkeley, United States

    6 publications · 531 citations

    6

    h-index

  2. AC
    Anas Chaaban

    King Abdullah University of Science and Technology, Saudi Arabia

    6 publications · 140 citations

    6

    h-index

  3. AS
    Aydin Sezgin

    Ruhr University Bochum, Germany

    6 publications · 140 citations

    6

    h-index

  4. GK
    Gerhard Kramer

    Technical University of Munich, Germany

    5 publications · 202 citations

    5

    h-index

  5. WK
    Wei Kang

    Southeast University, China

    4 publications · 96 citations

    4

    h-index

1–5 of 353

Venues

  1. IEEE Transactions on Information Theory

    29 publications · 1.3K citations

    18

    h-index

  2. IEEE Transactions on Reliability

    12 publications · 290 citations

    11

    h-index

  3. arXiv (Cornell University)

    Repository · 7 publications · 129 citations

    7

    h-index

  4. Reliability Engineering & System Safety

    6 publications · 181 citations

    6

    h-index

  5. Mathematical Programming

    5 publications · 332 citations

    5

    h-index

1–5