1963 search results - page 173 / 393 » The Maximum Solution Problem on Graphs |
134
Voted
ALGORITHMICA
2007
15 years 2 months ago
2007
In this paper we study the problems of detecting holes and antiholes in general undirected graphs, and we present algorithms for these problems. For an input graph G on n vertices ...
101
Voted
ICCD
2004
IEEE
15 years 11 months ago
2004
IEEE
The increasing clock frequencies in high-end industrial circuits bring new routing challenges that can not be handled by traditional algorithms. An important design automation pro...
113
Voted
CP
2008
Springer
15 years 4 months ago
2008
Springer
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
109
Voted
ICIAR
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. This paper presents an approach based on graph cuts initially used for motion segmentation that is being applied to the nonrigid registration problem. The main contributi...
111
click to vote
GECCO
2000
Springer
15 years 6 months ago
2000
Springer
We propose a new Genetic Algorithm (GA) for solving the minimum span frequency assignment problem (MSFAP). The MSFAP is minimizing the range of the frequencies assigned to each tr...