W e introduce a class of graphs which are variants of the hypercube graph. M a n y of the properties of this class of graphs are similar to that of the hypercube hence, we refer t...
Aniruddha S. Vaidya, P. S. Nagendra Rao, S. Ravi S...
In this paper, we propose a new distributed algorithm that constructs a sparse spanner subgraph of the unit disk graph efficiently for wireless ad hoc networks. It maintains a li...
We conduct an experimental analysis of a distributed, randomized algorithm for edge coloring graphs. The algorithm is extremely simple, yet, according to the probabilistic analysi...
Madhav V. Marathe, Alessandro Panconesi, Larry D. ...
Integrated Development Environments supporting software and model evolution have to deal with the problem of maintaining coherence between code and model despite changes which may...
Paolo Bottoni, Francesco Parisi-Presicce, Simone P...
We consider an agent-target assignment problem in an unknown environment modeled as an undirected graph. Agents do not know this graph or the locations of the targets on it. Howeve...