3268 search results - page 595 / 654 » The hub number of a graph |
118
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
124
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Abstract—In distributed storage systems built using commodity hardware, it is necessary to store multiple replicas of every data chunk in order to ensure system reliability. In s...
108
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
A sequence is nonrepetitive if it does not contain two adjacent identical blocks. The remarkable construction of Thue asserts that 3 symbols are enough to build an arbitrarily long...
190
click to vote
DISOPT
2011
14 years 6 months ago
2011
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
ISCI
2011
14 years 6 months ago
2011
We define an interconnection network AQn,k which we call the augmented kary n-cube by extending a k-ary n-cube in a manner analogous to the existing extension of an n-dimensional...