24 search results - page 1 / 5 » The flipping puzzle on a graph |
79
Voted
EJC
2010
15 years 14 days ago
2010
Let S be a connected graph which contains an induced path of n-1 vertices, where n is the order of S. We consider a puzzle on S. A configuration of the puzzle is simply an n-dimen...
124
click to vote
GD
2003
Springer
15 years 5 months ago
2003
Springer
We address the new problem of puzzle layout as a new application of awing. We present two abstract models of puzzles, permutation puzzles and cyclic puzzles, which can be modeled a...
95
Voted
SIAMDM
2008
15 years 10 days ago
2008
Given a partition of the vertices of a graph into two sets, a flip is a move of a vertex from its own set to the other, under the condition that it has more incident edges to vert...
94
Voted
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
We study a switch Markov chain on regular graphs, where switches are allowed only between links that are at distance 3; we call this the Flip. The motivation for studying the Flip...
113
click to vote
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
We explore the problem of reconstructing an image from a bag of square, non-overlapping image patches, the jigsaw puzzle problem. Completing jigsaw puzzles is challenging and requ...