205 search results - page 31 / 41 » Pruning 2-Connected Graphs |
ADBIS
2003
Springer
14 years 1 months ago
2003
Springer
Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistance-value” of this n-tuple is the value of a linear function of distances of the n objects...
WISE
2002
Springer
14 years 1 months ago
2002
Springer
Delta compression techniques are commonly used to succinctly represent an updated version of a file with respect to an earlier one. In this paper, we study the use of delta compr...
DASFAA
2008
IEEE
13 years 10 months ago
2008
IEEE
Recently, great efforts have been dedicated to researches on the management of large-scale graph-based data, where node disjoint subgraph homeomorphism relation between graphs has ...
SADM
2010
13 years 6 months ago
2010
The goal of frequent subgraph mining is to detect subgraphs that frequently occur in a dataset of graphs. In classification settings, one is often interested in discovering discr...
WINET
2010
13 years 6 months ago
2010
We consider the problem of static transmission-power assignment for lifetime maximization of a wireless sensor network with stationary nodes operating in a data-gathering scenario...