In this paper, we revisit the enumeration of directed animals using gas models. We show that there exists a natural construction of random directed animals on any directed graph t...
In this paper, we revisit the enumeration of directed animals using gas models. We show that there exists a natural construction of random directed animals on any directed graph t...
— Mobility models are widely used in simulation-based performance analyses of mobile networks. However, there is a trade-off between simplicity and realistic movement patterns. S...
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...