5889 search results - page 246 / 1178 » Graph Layout Problems |
152
click to vote
MLG
2007
Springer
16 years 23 days 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...
207
click to vote
BIRTHDAY
2010
Springer
15 years 7 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
129
click to vote
GECCO
2006
Springer
15 years 10 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...
181
click to vote
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
Connected Vertex Cover Problem (CVC) is an NP-hard problem. The currently best known approximation algorithm for CVC has performance ration 2. This paper gives the first Polynomial...
195
Voted
JCT
2008
15 years 6 months ago
2008
Given an undirected hypergraph and a subset of vertices S V with a specified root vertex r S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the hypered...