The Use of Wye-Delta Transformations in Network Simplification

DOI10.1287/OPRE.8.3.311MaRDI QIDQ3266137zbMATH OpenOpenAlexFDO

Authors 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

Cited in

(12)

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

This page was built for publication: The Use of Wye-Delta Transformations in Network Simplification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3266137)