Sciweavers

IWOCA
2009
Springer
152views Algorithms» more  IWOCA 2009»
13 years 11 months ago
Edge-Simple Circuits through 10 Ordered Vertices in Square Grids
A circuit in a simple undirected graph G = (V, E) is a sequence of vertices {v1, v2, . . . , vk+1} such that v1 = vk+1 and {vi, vi+i} ∈ E for i = 1, . . . , k. A circuit C is sai...
David Coudert, Frédéric Giroire, Ign...