Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs

Sergio Cabello, Bojan Mohar. Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs. In Gerth Stølting Brodal, Stefano Leonardi, editors, Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings. Volume 3669 of Lecture Notes in Computer Science, pages 131-142, Springer, 2005. [doi]

Abstract

Abstract is missing.