Skip to main navigation Skip to search Skip to main content

On Complexity of Computing Bottleneck and Lexicographic Optimal Cycles in a Homology Class

  • Saint Louis University
  • University of Utah

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

Original languageEnglish
Title of host publication38th International Symposium on Computational Geometry, SoCG 2022
EditorsXavier Goaoc, Michael Kerber
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959772273
DOIs
StatePublished - Jun 1 2022
Externally publishedYes
Event38th International Symposium on Computational Geometry, SoCG 2022 - Berlin, Germany
Duration: Jun 7 2022Jun 10 2022

Publication series

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

Conference

Conference38th International Symposium on Computational Geometry, SoCG 2022
Country/TerritoryGermany
CityBerlin
Period6/7/226/10/22

ASJC Scopus Subject Areas

  • Software

Keywords

  • bottleneck optimal cycles
  • computational topology
  • homology

Cite this