Finding shortest contractible and shortest separating cycles in embedded graphs

Sergio Cabello. Finding shortest contractible and shortest separating cycles in embedded graphs. In Claire Mathieu, editor, Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009. pages 616-624, SIAM, 2009. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.