Sciweavers

6 search results - page 2 / 2
» Diameter and Treewidth in Minor-Closed Graph Families, Revis...
Sort
View
COMPGEOM
2010
ACM
13 years 10 months ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...