Sciweavers

12 search results - page 3 / 3
» A Partial k-Arboretum of Graphs with Bounded Treewidth
Sort
View
COMPGEOM
2010
ACM
13 years 11 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è...
ICTAI
2010
IEEE
13 years 3 months ago
A New Filtering Based on Decomposition of Constraint Sub-Networks
In this paper, we introduce a new partial consistency for constraint networks which is called Structural Consistency of level w and is denoted w-SC consistency. This consistency i...
Philippe Jégou, Cyril Terrioux