Debmalya Panigrahi

A New Channel Assignment Mechanism for Rural Wireless Mesh Networks (2008)

Partha Dutta, Sharad Jaiswal, Debmalya Panigrahi, Rajeev Rastogi

villages gateway node Fig. 1. A rural wireless mesh network. Abstract — In this paper we present a new channel allocation scheme for IEEE 802.11 based mesh networks with point-topoint links,...

User User (2008)

Debmalya Panigrahi, Arv Review P

Balanced vertex sets, small cuts

Efficient Algorithms for Computing All Low s-t Edge Connectivities and Related (2007)

Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi

Given an undirected unweighted graph G =(V,E) andan integer k ≥ 1, we consider the problem of computing the edge connectivities of all those (s, t) vertex pairs, whose edge connectivity is at most...

Efficient Algorithms for Computing All Low s-t Edge Connectivities and Related (2007)

Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi

Given an undirected unweighted graph G = (V, E) and an integer k ≥ 1, we consider the problem of computing the

Villagenet: A low-cost, 802.11-based mesh network for rural regions (2007)

Partha Dutta, Sharad Jaiswal, Debmalya Panigrahi

Abstract — VillageNet is a wireless mesh network that aims to provide low-cost broadband Internet access for rural regions. The cost of building the network is kept low by using off-the-shelf IEEE...

An (O)over-tilde(mn) Gomory-Hu Tree Construction Algorithm for Unweighted Graphs (2007)

Bhalgat, Anand, Hariharan, Ramesh, Kavitha, Telikepalli, Panigrahi, Debmalya

We present a fast algorithm for computing a Gomory-Hu tree or cut tree for an unweighted undirected graph G = (V, E). The expected running time of our algorithm is (O) over tilde (mc) where vertical...