2283 search results - page 274 / 457 » Bounds of Graph Characteristics |
124
Voted
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
136
Voted
COCO
2010
Springer
15 years 7 months ago
2010
Springer
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
119
Voted
SIAMDM
2010
15 years 1 months ago
2010
Graph theory has been used to characterize the solvability of the sensor network localization problem. If sensors correspond to vertices and edges correspond to sensor pairs betwee...
143
Voted
TCS
2010
15 years 1 months ago
2010
Cops and Robbers is a pursuit and evasion game played on graphs that has received much attention. We consider an extension of Cops and Robbers, distance k Cops and Robbers, where t...
162
Voted
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...