𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient Algorithms fork-Terminal Cuts on Planar Graphs

✍ Scribed by Danny Z. Chen; Xiadong Wu

Publisher
Springer
Year
2003
Tongue
English
Weight
285 KB
Volume
38
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On terminal delta-wye reducibility of pl
On terminal delta-wye reducibility of planar graphs
✍ Isidoro Gitler; FeliΓΊ Sagols πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 614 KB

We prove terminal -Y reducibility of planar graphs with at most three terminals. The most important consequence of our proof is that this implicitly gives an efficient algorithm with time complexity O(|E (G)| 4 ) for reducibility of planar graphs G with at most three terminals. It also can be used f