Given a graph G, a function f : V (G) {1, 2, . . . , k} is a k-ranking of G if f (u) = f (v) implies every u - v path contains a vertex w such that f (w) > f (u). A k-ranking ...
Victor Kostyuk, Darren A. Narayan, Victoria A. Wil...
A detailed exposition of Kneser’s neighbour method for quadratic lattices over totally real number fields, and of the sub-procedures needed for its implementation, is given. Usi...
In this paper, we study the cheap control problem and determine what some of the inherent system limitations are in achieving high performance for LTI systems. In particular, we ob...
In this paper, a new information theoretic algorithm is proposed for signal enumeration in DS-CDMA networks. The approach is based on the predictive description length (PDL) of the...
Let n be the fraction of structures of size" n which are connected"; e.g., a the fraction of labeled or unlabeled n-vertex graphshavingone component, b the fraction of p...
Jason P. Bell, Edward A. Bender, Peter J. Cameron,...