This paper considers the problem of computing the dense k -vertex subgraph of a given graph, namely, the subgraph with the most edges. An approximation algorithm is developed for the problem, withâ€¦ (More)

This paper is concerned with the solvability of the problem of processor renaming in unreliable, completely asynchronous distributed systems. Fischer et al. prove in [8] that “nontrivialâ€¦ (More)

This paper studies fault tolerant algorithms for the problem of gathering <i>N</i> autonomous mobile robots. A gathering algorithm, executed independently by each robot, must ensure that all robotsâ€¦ (More)

A radio network is a synchronous network of processors that communicate by transmitting messages to their neighbors, where a processor receives a message in a given step if and only if it is silentâ€¦ (More)

This abstract presents a collection of clustering and decomposition techniques enabling the construction of sparse and locality preserving representations for arbitrary networks. These new clusteringâ€¦ (More)

Two conflicting goals play a crucial role in the design of routing schemes for communication networks. A routing scheme should use paths that are as short as possible for routing messages in theâ€¦ (More)

We consider the problem of labeling the nodes of a graph in a way that will allow one to compute the distance between any two nodes directly from their labels (without using any additionalâ€¦ (More)