187 search results - page 12 / 38 » Improved Approximation of MAX-CUT on Graphs of Bounded Degre... |
JGAA
2007
13 years 7 months ago
2007
The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some n...
COCOON
2005
Springer
14 years 1 months ago
2005
Springer
We study the worst-case performance of the maximal matching heuristic applied to the Minimum Vertex Cover and Minimum Maximal Matching problems, through a careful analysis of tigh...
COCOON
2004
Springer
14 years 1 months ago
2004
Springer
The problem of efficiently monitoring the network flow is regarded as the one to find out the minimum weighted weak vertex cover set for a given graph G = (V, E) with weight func...
ISAAC
2000
Springer
13 years 11 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...
DM
2008
13 years 7 months ago
2008
One of the basic results in graph theory is Dirac's theorem, that every graph of order n 3 and minimum degree n/2 is Hamiltonian. This may be restated as: if a graph of ord...