Sciweavers

2 search results - page 1 / 1
» On Arithmetic Progressions Of Cycle Lengths In Graphs
Sort
View
CPC
2000
82views more  CPC 2000»
13 years 3 months ago
On Arithmetic Progressions Of Cycle Lengths In Graphs
A recently posed question of H
Jacques Verstraëte
FSTTCS
2010
Springer
13 years 1 months ago
The effect of girth on the kernelization complexity of Connected Dominating Set
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...
Neeldhara Misra, Geevarghese Philip, Venkatesh Ram...