Many “ubiquitous computing” applications need a constant flow of information about their environment to be able to adapt to their changing context. To support these “contex...
In this paper we introduce a new notion of collective tree spanners. We say that a graph G = (V, E) admits a system of µ collective additive tree r-spanners if there is a system T...
With the development of highly efficient graph data collection technology in many application fields, classification of graph data emerges as an important topic in the data mining...
Abstract. In this paper we study the existence of a small set T of spanning trees that collectively “1-span” an interval graph G. In particular, for any pair of vertices u, v w...
Derek G. Corneil, Feodor F. Dragan, Ekkehard K&oum...
As the amount of online formal mathematical content grows, for example through active efforts such as the Mathweb [21], MOWGLI [4], Formal Digital Library, or FDL [1], and others, ...
Lori Lorigo, Jon M. Kleinberg, Richard Eaton, Robe...