This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a ...
A common problem in visualising some networks is the presence of localised high density areas in an otherwise sparse graph. Applying common graph drawing algorithms on such networ...
Currently, a large amount of data can be best represented as graphs, e.g., social networks, protein interaction networks, etc. The analysis of these networks is an urgent research ...
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
Motivated by questions in computer vision and sensor networks, Alpert et al. [3] introduced the following definitions. Given a graph G, an obstacle representation of G is a set of...