Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
A caterpillar is a tree in which all vertices of degree three or more lie on one path, called the backbone. We present a polynomial time algorithm that produces a linear arrangeme...
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...
We visualize the structure of sections of the World Wide Web by constructing graphical representations in 3D hyperbolic space. The felicitous property that hyperbolic space has â€...