The probability distribution on a set S = { 1, 2, . . . , n } defined by Pr(k) = 1/(Hnk), where Hn in the nth harmonic number, is commonly called a Zipfian distribution. In this no...
Let T be a fixed tournament on k vertices. Let D(n, T) denote the maximum number of orientations of an n-vertex graph that have no copy of T. We prove that D(n, T) = 2tk-1(n) for ...
For two given graphs G1 and G2, the Ramsey number R(G1, G2) is the smallest positive integer n such that for any graph G of order n, either G contains G1 or the complement of G co...
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...