P. R. Subramanya

Learn More
The Pfaffian of an oriented graph is closely linked to Perfect Matching. It is also naturally related to the determinant of an appropriately defined matrix. This relation between Pfaffian and determinant is usually exploited to give a fast algorithm for computing Pfaffians. We present the first completely combinatorial algorithm for computing the Pfaffian(More)
The Pfaaan of a graph is closely linked to Perfect Matching. It is also naturally related to the determinant of an appropriately deened matrix. This relation between Pfaaan and determinant is usually exploited to give a fast algorithm for computing Pfaaans. We present the rst completely combinatorial algorithm for computing the Pfaaan in polynomial time. In(More)
In this paper, we present a novel application for subsidizing the cost of SMS-based messaging, especially in mobile operator networks which have started showing the ldquointentional missed callrdquo phenomenon. The existing SMS infrastructure is augmented with an advertisement capability, borrowed from the Internet model to either subsidize the cost of or(More)
  • 1