Finding shortest contractible and shortest separating cycles in embedded graphs
From MaRDI portal
Publication:2930300
DOI10.1145/1721837.1721840zbMath1300.05296OpenAlexW2077970810MaRDI QIDQ2930300
No author found.
Publication date: 18 November 2014
Published in: (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.417.7022
No records found.
No records found.
Related Items (6)
Minimum Cuts in Surface Graphs ⋮ The cycle's structure of embedded graphs in surfaces ⋮ Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths ⋮ Topologically trivial closed walks in directed surface graphs ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication: Finding shortest contractible and shortest separating cycles in embedded graphs
