Delta-Wye Transformations and the Efficient Reduction of Two-Terminal Planar Graphs
From MaRDI portal
Publication:4202458
DOI10.1287/opre.41.3.572zbMath0784.90095OpenAlexW2031769269MaRDI QIDQ4202458
J. Scott Provan, Thomas A. Feo
Publication date: 21 March 1994
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.41.3.572
shortest pathelectrical resistancemax flowdelta-wye transformationsconnected two-terminal, undirected, planar graph
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A new approach to solving three combinatorial enumeration problems on planar graphs ⋮ Estimation of flows in flow networks ⋮ Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs ⋮ Untangling planar curves ⋮ An algorithm for delta-wye reduction of almost-planar graphs ⋮ On mimicking networks representing minimum terminal cuts ⋮ Delta-wye reduction of almost-planar graphs ⋮ Combinatorial aspects of network reliability ⋮ Improved Guarantees for Vertex Sparsification in Planar Graphs ⋮ Unnamed Item ⋮ On spin models, triply regular association schemes, and duality ⋮ On terminal delta-wye reducibility of planar graphs ⋮ Expected value expansions in rooted graphs ⋮ Lower bounds for electrical reduction on surfaces ⋮ Network reliability: Numbers or insight? (A discussion paper)
