974 search results - page 135 / 195 » pairing 2010 |
DM
1998
13 years 10 months ago
1998
Let G be a median graph on n vertices and m edges and let k be the number of equivalence classes of the Djokovi´c’s relation Θ defined on the edge-set of G. Then 2n − m −...
CORR
2010
Springer
2010
Springer
Understanding periodicity and regularity of nodal encounters in mobile networks: A spectral analysis
13 years 10 months ago
Abstract--Study on human mobility is gaining increasing attention from the research community with its multiple applications to use in mobile networks, particularly for the purpose...
ASUNAM
2010
IEEE
13 years 9 months ago
2010
IEEE
—In email networks, user behaviors affect the way emails are sent and replied. While knowing these user behaviors can help to create more intelligent email services, there has no...
ATMOS
2010
13 years 9 months ago
2010
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...