Lower bounds for electrical reduction on surfaces

Hsien Chih Chang, Marcos Cossarini, Jeff G Erickson

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We strengthen the connections between electrical transformations and homotopy from the planar setting – observed and studied since Steinitz – to arbitrary surfaces with punctures. As a result, we improve our earlier lower bound on the number of electrical transformations required to reduce an n-vertex graph on surface 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 Ω(n2) lower bound when the planar graph has two or more terminals, which follows from a quadratic lower bound on the number of homotopy moves in the annulus. 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 follow from the observation that the defect of the medial graph of a planar graph is the same for all its planar embeddings.

Original languageEnglish (US)
Title of host publication35th International Symposium on Computational Geometry, SoCG 2019
EditorsGill Barequet, Yusu Wang
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959771047
DOIs
StatePublished - Jun 1 2019
Event35th International Symposium on Computational Geometry, SoCG 2019 - Portland, United States
Duration: Jun 18 2019Jun 21 2019

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume129
ISSN (Print)1868-8969

Conference

Conference35th International Symposium on Computational Geometry, SoCG 2019
CountryUnited States
CityPortland
Period6/18/196/21/19

Fingerprint

Defects

Keywords

  • 2-flipping
  • Defect
  • Electrical transformation
  • Homotopy
  • Routing set
  • Smoothings
  • SPQR-tree
  • Tight
  • ∆Y-transformation

ASJC Scopus subject areas

  • Software

Cite this

Chang, H. C., Cossarini, M., & Erickson, J. G. (2019). Lower bounds for electrical reduction on surfaces. In G. Barequet, & Y. Wang (Eds.), 35th International Symposium on Computational Geometry, SoCG 2019 [25] (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 129). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2019.25

Lower bounds for electrical reduction on surfaces. / Chang, Hsien Chih; Cossarini, Marcos; Erickson, Jeff G.

35th International Symposium on Computational Geometry, SoCG 2019. ed. / Gill Barequet; Yusu Wang. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2019. 25 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 129).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chang, HC, Cossarini, M & Erickson, JG 2019, Lower bounds for electrical reduction on surfaces. in G Barequet & Y Wang (eds), 35th International Symposium on Computational Geometry, SoCG 2019., 25, Leibniz International Proceedings in Informatics, LIPIcs, vol. 129, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 35th International Symposium on Computational Geometry, SoCG 2019, Portland, United States, 6/18/19. https://doi.org/10.4230/LIPIcs.SoCG.2019.25
Chang HC, Cossarini M, Erickson JG. Lower bounds for electrical reduction on surfaces. In Barequet G, Wang Y, editors, 35th International Symposium on Computational Geometry, SoCG 2019. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2019. 25. (Leibniz International Proceedings in Informatics, LIPIcs). https://doi.org/10.4230/LIPIcs.SoCG.2019.25
Chang, Hsien Chih ; Cossarini, Marcos ; Erickson, Jeff G. / Lower bounds for electrical reduction on surfaces. 35th International Symposium on Computational Geometry, SoCG 2019. editor / Gill Barequet ; Yusu Wang. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2019. (Leibniz International Proceedings in Informatics, LIPIcs).
@inproceedings{efc3e2babb6d42bb87e17f4c509d3bf5,
title = "Lower bounds for electrical reduction on surfaces",
abstract = "We strengthen the connections between electrical transformations and homotopy from the planar setting – observed and studied since Steinitz – to arbitrary surfaces with punctures. As a result, we improve our earlier lower bound on the number of electrical transformations required to reduce an n-vertex graph on surface 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 Ω(n2) lower bound when the planar graph has two or more terminals, which follows from a quadratic lower bound on the number of homotopy moves in the annulus. 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 follow from the observation that the defect of the medial graph of a planar graph is the same for all its planar embeddings.",
keywords = "2-flipping, Defect, Electrical transformation, Homotopy, Routing set, Smoothings, SPQR-tree, Tight, ∆Y-transformation",
author = "Chang, {Hsien Chih} and Marcos Cossarini and Erickson, {Jeff G}",
year = "2019",
month = "6",
day = "1",
doi = "10.4230/LIPIcs.SoCG.2019.25",
language = "English (US)",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Gill Barequet and Yusu Wang",
booktitle = "35th International Symposium on Computational Geometry, SoCG 2019",

}

TY - GEN

T1 - Lower bounds for electrical reduction on surfaces

AU - Chang, Hsien Chih

AU - Cossarini, Marcos

AU - Erickson, Jeff G

PY - 2019/6/1

Y1 - 2019/6/1

N2 - We strengthen the connections between electrical transformations and homotopy from the planar setting – observed and studied since Steinitz – to arbitrary surfaces with punctures. As a result, we improve our earlier lower bound on the number of electrical transformations required to reduce an n-vertex graph on surface 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 Ω(n2) lower bound when the planar graph has two or more terminals, which follows from a quadratic lower bound on the number of homotopy moves in the annulus. 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 follow from the observation that the defect of the medial graph of a planar graph is the same for all its planar embeddings.

AB - We strengthen the connections between electrical transformations and homotopy from the planar setting – observed and studied since Steinitz – to arbitrary surfaces with punctures. As a result, we improve our earlier lower bound on the number of electrical transformations required to reduce an n-vertex graph on surface 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 Ω(n2) lower bound when the planar graph has two or more terminals, which follows from a quadratic lower bound on the number of homotopy moves in the annulus. 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 follow from the observation that the defect of the medial graph of a planar graph is the same for all its planar embeddings.

KW - 2-flipping

KW - Defect

KW - Electrical transformation

KW - Homotopy

KW - Routing set

KW - Smoothings

KW - SPQR-tree

KW - Tight

KW - ∆Y-transformation

UR - http://www.scopus.com/inward/record.url?scp=85068063822&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85068063822&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.SoCG.2019.25

DO - 10.4230/LIPIcs.SoCG.2019.25

M3 - Conference contribution

AN - SCOPUS:85068063822

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 35th International Symposium on Computational Geometry, SoCG 2019

A2 - Barequet, Gill

A2 - Wang, Yusu

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

ER -