785 search results - page 97 / 157 » Embedding a Forest in a Graph |
157
click to vote
KDD
2004
ACM
15 years 9 months ago
2004
ACM
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
153
click to vote
ESAS
2006
Springer
15 years 8 months ago
2006
Springer
We derive the optimality results for key pre distribution scheme for distributed sensor networks, and relations between interesting parameters. Namely, given a key-pool of size n ...
161
click to vote
COCOON
1999
Springer
15 years 8 months ago
1999
Springer
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...
110
click to vote
ICDCS
2009
IEEE
16 years 1 months ago
2009
IEEE
A number of network path delay, loss, or bandwidth inference mechanisms have been proposed over the past decade. Concurrently, several network measurement services have been deplo...
192
click to vote
VLDB
2002
ACM
15 years 3 months ago
2002
ACM
Web-based data sources, particularly in Life Sciences, grow in diversity and volume. Most of the data collections are equipped with common document search, hyperlink and retrieval...