Name
Abstract | ||
|---|---|---|
<P>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.</P> |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1287/opre.41.3.572 | Operations Research |
Field | DocType | Volume |
Graph theory,Topology,Mathematical optimization,Combinatorics,Electrical network,Shortest path problem,Analysis of algorithms,Maximum flow problem,Connectivity,Mathematics,Planar graph | Journal | 41 |
Issue | ISSN | Citations |
3 | 0030-364X | 13 |
PageRank | References | Authors |
1.39 | 5 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thomas A. Feo | 1 | 163 | 23.88 |
| J. Scott Provan | 2 | 678 | 90.11 |