2487 search results - page 198 / 498 » Partitions of Graphs into Trees |
123
click to vote
ICPR
2010
IEEE
15 years 6 months ago
2010
IEEE
In this paper we survey two multi-dimensional Scale Saliency approaches based on graphs and the k-d partition algorithm. In the latter case we introduce a new divergence metric an...
152
click to vote
IACR
2011
14 years 3 months ago
2011
A transitive signature scheme allows to sign a graph in such a way that, given the signatures of edges (a, b) and (b, c), it is possible to compute the signature for the edge (or ...
134
click to vote
ICALP
2001
Springer
15 years 8 months ago
2001
Springer
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
152
Voted
PODS
1993
ACM
15 years 8 months ago
1993
ACM
In this paper we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented...
264
Voted
ICDE
2009
IEEE
16 years 5 months ago
2009
IEEE
Due to its considerable ease of use, relational keyword search (R-KWS) has become increasingly popular. Its simplicity, however, comes at the cost of intensive query processing. Sp...