4 search results - page 1 / 1 » Dense Minors In Graphs Of Large Girth |
COMBINATORICA
2004
13 years 5 months ago
2004
JCT
2002
13 years 4 months ago
2002
FSTTCS
2010
Springer
13 years 3 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
STOC
2004
ACM
14 years 5 months ago
2004
ACM
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...