The Use of Wye-Delta Transformations in Network Simplification

DOI10.1287/opre.8.3.311zbMath0091.15901OpenAlexW1969229778MaRDI QIDQ3266137

S. B. Akers

Publication date: 1960

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.8.3.311

zbMATH Keywords

applications of probability theory and statistics

Related Items

Simplification of reversible Markov chains by removal of states with low equilibrium occupancy ⋮ A new approach to solving three combinatorial enumeration problems on planar graphs ⋮ Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs ⋮ Some problems in discrete optimization ⋮ Untangling planar curves ⋮ An algorithm for delta-wye reduction of almost-planar graphs ⋮ Optimal flows in networks with multiple sources and sinks ⋮ On two dual classes of planar graphs ⋮ On the uniqueness of kernels ⋮ Shortest-path queries in static networks ⋮ Engpässe, Staustellen und glatte homogene Ströme in Netzen ⋮ Simplification of irreversible Markov chains by removal of states with fast leaving rates