6740 search results - page 319 / 1348 » An s -Hamiltonian Line Graph Problem |
158
Voted
ISAAC
2000
Springer
15 years 7 months ago
2000
Springer
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...
131
click to vote
EVOW
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We introduce a novel representation for the graph colouring problem, called the Integer Merge Model, which aims to reduce the time complexity of an algorithm. Moreover, o...
144
click to vote
ECCC
2006
15 years 4 months ago
2006
We present two new methods for finding a lowest common ancestor (LCA) for each pair of vertices of a directed acyclic graph (dag) on n vertices and m edges. The first method is su...
131
click to vote
SAC
2010
ACM
15 years 11 months ago
2010
ACM
This article addresses the problem of efficient multi-robot patrolling in a known environment. The proposed approach assigns regions to each mobile agent. Every region is represen...
123
Voted
MFCS
1995
Springer
15 years 7 months ago
1995
Springer
The graph inference from a walk for a class C of undirected edge-colored graphs is, given a string x of colors, nding the smallest graph G in C that allows a traverse of all edge...