6740 search results - page 426 / 1348 » An s -Hamiltonian Line Graph Problem |
169
click to vote
APPROX
2010
Springer
15 years 8 months ago
2010
Springer
We consider two natural generalizations of the Asymmetric Traveling Salesman problem: the k-Stroll and the k-Tour problems. The input to the k-Stroll problem is a directed n-verte...
186
click to vote
ICCV
2005
IEEE
16 years 8 months ago
2005
IEEE
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...
178
click to vote
MLG
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. There are many connections between graph mining and inductive logic programming (ILP), or more generally relational learning. Up till now these connections have mostly be...
161
click to vote
ESA
2004
Springer
16 years 5 days ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
202
click to vote
ICALP
1992
Springer
15 years 11 months ago
1992
Springer
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...