736 search results - page 31 / 148 » Approximating the Number of Network Motifs |
143
click to vote
HIPC
2007
Springer
15 years 5 months ago
2007
Springer
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
138
Voted
CORR
2012
Springer
13 years 9 months ago
2012
Springer
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...
CORR
2010
Springer
15 years 16 days ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
129
click to vote
SODA
1998
ACM
15 years 3 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
96
Voted
CN
2006
15 years 2 months ago
2006
We first study the distribution of path duration in multi-hop wireless networks. We show that as the number of hops along a path increases, the path duration distribution can be a...