论文信息 - Delta-Wye Transformations and the Efficient Reduction of Two-Terminal Planar Graphs

Delta-Wye Transformations and the Efficient Reduction of Two-Terminal Planar Graphs

A simple, O(|V|2) time algorithm is presented that reduces a connected two-terminal, undirected, planar graph to a single edge, by way of series and parallel reductions and delta-wye transformations. The method is applied to a class of optimization/equilibnum problems which includes max flow, shortest path, and electrical resistance problems.

J. Scott Provan | Thomas A. Feo | J. S. Provan | T. Feo

[1] J. Scott Provan,et al. The Complexity of Reliability Computations in Planar and Acyclic Graphs , 1986, SIAM J. Comput..

[2] Stefan Arnborg,et al. Forbidden minors characterization of partial 3-trees , 1990, Discret. Math..

[3] Klaus Truemper,et al. On the delta-wye reduction for planar graphs , 1989, J. Graph Theory.

[4] Charles J. Colbourn,et al. On two dual classes of planar graphs , 1990, Discret. Math..

[5] S. Akers. The Use of Wye-Delta Transformations in Network Simplification , 1960 .

[6] Tom Brylawski. A Determinantal Identity for Resistive Networks , 1977 .

[7] A. Satyanarayana,et al. A linear-time algorithm to compute the reliability of planar cube-free networks , 1990 .

[8] Sundaram Seshu,et al. Linear Graphs and Electrical Networks , 1961 .

[9] Eugene L. Lawler,et al. The Recognition of Series Parallel Digraphs , 1982, SIAM J. Comput..

[10] Themistocles Politof,et al. A characterization and efficient reliability computation of delta-y reducible networks , 1983 .

[11] Bela Bollobas,et al. Graph theory , 1979 .

[12] A. Lehman. Wye-Delta Transformation in Probablilistic Networks , 1963 .

[13] R. Baxter. Exactly solved models in statistical mechanics , 1982 .