966 search results - page 38 / 194 » Small Alliances in Graphs |
CCCG
2010
13 years 10 months ago
2010
We propose algorithms for efficiently maintaining a constant-approximate minimum connected dominating set (MCDS) of a geometric graph under node insertions and deletions. Assuming...
ATMOS
2009
13 years 9 months ago
2009
We present a set of three new time-dependent models with increasing flexibility for realistic route planning in flight networks. By these means, we obtain small graph sizes while m...
RSA
2011
13 years 3 months ago
2011
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...
PR
2008
13 years 8 months ago
2008
The spectrum of a graph has been widely used in graph theory to characterise the properties of a graph and extract information from its structure. It has also been employed as a g...
BMCBI
2008
13 years 8 months ago
2008
Background: Biomedical and chemical databases are large and rapidly growing in size. Graphs naturally model such kinds of data. To fully exploit the wealth of information in these...