354 search results - page 41 / 71 » The Chromatic Number Of Graph Powers |
COMBINATORICA
2008
14 years 12 months ago
2008
Consider the following seemingly rhetorical question: Is it crucial for a property-tester to know the error parameter in advance? Previous papers dealing with various testing prob...
ICALP
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
SIAMCOMP
2000
14 years 11 months ago
2000
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
107
click to vote
HT
2010
ACM
15 years 1 months ago
2010
ACM
We investigate the use of autonomically created small-world graphs as a framework for the long term storage of digital objects on the Web in a potentially hostile environment. We ...
GLOBECOM
2006
IEEE
15 years 5 months ago
2006
IEEE
— While the Internet continues to thrive, the resiliency of its fundamental routing infrastructure is not fully understood. In this paper, we analyze the behavior of the de facto...