Sciweavers

Share
59 search results - page 1 / 12
» On Approximating Minimum Vertex Cover for Graphs with Perfec...
Sort
View
ISAAC
2000
Springer
135views Algorithms» more  ISAAC 2000»
8 years 10 months ago
On Approximating Minimum Vertex Cover for Graphs with Perfect Matching
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...
Jianer Chen, Iyad A. Kanj
STOC
2009
ACM
123views Algorithms» more  STOC 2009»
9 years 7 months ago
An improved constant-time approximation algorithm for maximum~matchings
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
Yuichi Yoshida, Masaki Yamamoto, Hiro Ito
ISAAC
2007
Springer
183views Algorithms» more  ISAAC 2007»
9 years 1 months ago
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
Sounaka Mishra, Venkatesh Raman, Saket Saurabh, So...
JGT
2016
59views more  JGT 2016»
3 years 3 months ago
On Perfect Matching Coverings and Even Subgraph Coverings
: A perfect matching covering of a graph G is a set of perfect matchings of G such that every edge of G is contained in at least one member of it. Berge conjectured that every brid...
Xinmin Hou, Hong-Jian Lai, Cun-Quan Zhang
ICALP
2011
Springer
7 years 10 months ago
Vertex Cover in Graphs with Locally Few Colors
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
Fabian Kuhn, Monaldo Mastrolilli
books