59 search results - page 4 / 12 » Odd Cycle Packing |
CORR
2011
Springer
13 years 24 days ago
2011
Springer
Let k = (k1, . . . , kn) be a sequence of n integers. For an increasing monotone graph property P we say that a base graph G = ([n], E) is k-resilient with respect to P if for eve...
COCOON
2005
Springer
13 years 11 months ago
2005
Springer
DM
2010
13 years 5 months ago
2010
JCT
2002
13 years 5 months ago
2002
ALGORITHMICA
2011
13 years 25 days ago
2011
