For a graph G and k a real number, we consider the sum of the k-th powers of the degrees of the vertices of G. We present some general bounds on this sum for various values of k. ...
Abstract. We consider the problem of checking equivalence of conjunctive queries with inequalities under bag (multiset) semantics. The problem is known to be decidable in pspace an...
In this paper, we propose a new distributed algorithm that constructs a sparse spanner subgraph of the unit disk graph efficiently for wireless ad hoc networks. It maintains a li...