253 search results - page 10 / 51 » Perfection thickness of graphs |
ISAAC
2000
Springer
14 years 1 days 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...
EJC
2007
13 years 8 months ago
2007
Let K− r denote the graph obtained from Kr by deleting one edge. We show that for every integer r ≥ 4 there exists an integer n0 = n0(r) such that every graph G whose order n â...
JGT
2006
13 years 8 months ago
2006
It is well known that every bipartite graph with vertex classes of size n whose minimum degree is at least n/2 contains a perfect matching. We prove an analogue of this result for...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V, E) with n vertices...
WEA
2005
Springer
14 years 1 months ago
2005
Springer
We propose a novel algorithm based on random graphs to construct minimal perfect hash functions h. For a set of n keys, our algorithm outputs h in expected time O(n). The evaluatio...