6740 search results - page 267 / 1348 » An s -Hamiltonian Line Graph Problem |
89
Voted
CLASSIFICATION
2008
15 years 27 days ago
2008
Let G = (V, E, w) be a graph with vertex and edge sets V and E, respectively, and w : E IR+ a function which assigns a positive weight or length to each edge of G. G is called a r...
106
Voted
HEURISTICS
2006
15 years 24 days ago
2006
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
110
click to vote
ESA
1997
Springer
15 years 5 months ago
1997
Springer
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
121
Voted
ACCV
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. In this paper, we propose an efficient method for finding consistent correspondences between two sets of features. Our matching algorithm augments the discriminative pow...
117
Voted
LICS
2008
IEEE
15 years 7 months ago
2008
IEEE
The study of constraint satisfaction problems definable in various fragments of Datalog has recently gained considerable importance. We consider constraint satisfaction problems ...