6740 search results - page 291 / 1348 » An s -Hamiltonian Line Graph Problem |
197
click to vote
CORR
2004
Springer
15 years 3 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
121
click to vote
MLG
2007
Springer
15 years 10 months ago
2007
Springer
As a fundamental problem in pattern recognition, graph matching has found a variety of applications in the field of computer vision. In graph matching, patterns are modeled as gr...
94
Voted
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
We propose a new crossover that generalizes cycle crossover to permutations with repetitions and naturally suits partition problems. We tested it on graph partitioning problems ob...
124
click to vote
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—Communication networks are vulnerable to natural disasters, such as earthquakes or floods, as well as to physical attacks, such as an Electromagnetic Pulse (EMP) attack. Such r...
130
click to vote
ICCSA
2007
Springer
15 years 10 months ago
2007
Springer
Computational origami is the computer assisted study of origami as a branch of science of shapes. The origami construction is a countably finite sequence of fold steps, each consi...