1127 search results - page 84 / 226 » Testing the Expansion of a Graph |
WAW
2009
Springer
15 years 4 months ago
2009
Springer
Since the first investigations on web graph compression, it has been clear that the ordering of the nodes of the graph has a fundamental influence on the compression rate (usuall...
GD
2004
Springer
15 years 3 months ago
2004
Springer
It has been noted that many realistic graphs have a power law degree distribution and exhibit the small world phenomenon. We present drawing methods influenced by recent developm...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...
104
click to vote
SIGMOD
2012
ACM
13 years 9 days ago
2012
ACM
Most of the existing reachability indices perform well on small- to medium- size graphs, but reach a scalability bottleneck around one million vertices/edges. As graphs become inc...
JCO
2006
14 years 9 months ago
2006
Power assignment for wireless ad hoc networks is to assign a power for each wireless node such that the induced communication graph has some required properties. Recently research ...