Shortest non-trivial cycles in directed surface graphs

DOI10.1145/1998196.1998231zbMath1283.68359OpenAlexW2166937960MaRDI QIDQ5404429

Jeff Erickson

Publication date: 24 March 2014

Published in: Proceedings of the twenty-seventh annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1998196.1998231

zbMATH Keywords

computational topologytopological graph theory

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (5)

Minimum Cuts in Surface Graphs ⋮ Topologically trivial closed walks in directed surface graphs ⋮ Unnamed Item ⋮ Computing Surface Uniformization Using Discrete Beltrami Flow ⋮ Unnamed Item

This page was built for publication: Shortest non-trivial cycles in directed surface graphs