1963 search results - page 71 / 393 » The Maximum Solution Problem on Graphs |
156
click to vote
IWPEC
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...
126
click to vote
ICRA
2009
IEEE
15 years 10 months ago
2009
IEEE
— We consider the problem of tracking multiple agents moving amongst obstacles, using multiple cameras. Given an environment with obstacles, and many people moving through it, we...
139
click to vote
DAGSTUHL
2006
15 years 4 months ago
2006
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
119
Voted
INFORMS
2008
15 years 3 months ago
2008
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
132
click to vote
ICIP
2010
IEEE
15 years 1 months ago
2010
IEEE
In few years, graph cuts have become a leading method for solving a wide range of problems in computer vision. However, graph cuts involve the construction of huge graphs which so...