Submitted to the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (2018).
Includes results reported at the Computational Geometry: Young Researchers Forum, 2017.
We improve our earlier lower bounds on the number of electrical transformations required to reduce an n-vertex plane graph in the worst case [SOCG 2016] in two different directions. Our previous Ω(n3/2) lower bound applies only to facial electrical transformations on plane graphs with no terminals. First we provide a stronger Ω(n²) lower bound when the graph has two or more terminals, which follows from a quadratic lower bound on the number of homotopy moves in the annulus, described in a companion paper. Our second result extends our earlier Ω(n3/2) lower bound to the wider class of planar electrical transformations, which preserve the planarity of the graph but may delete cycles that are not faces of the given embedding. This new lower bound follows from the observation that the defect of the medial graph of a planar graph is the same for all its planar embeddings.