401 search results - page 37 / 81 » Sparse Quasi-Random Graphs |
ISPASS
2009
IEEE
14 years 2 months ago
2009
IEEE
Until recently, parallel programming has largely focused on the exploitation of data-parallelism in dense matrix programs. However, many important application domains, including m...
KDD
2008
ACM
14 years 8 months ago
2008
ACM
Attributed graphs are increasingly more common in many application domains such as chemistry, biology and text processing. A central issue in graph mining is how to collect inform...
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
—Vehicular ad hoc networks (VANETs) represent promising technologies for improving driving safety and efficiency. Due to the highly dynamic driving patterns of vehicles, it has ...
INFOCOM
2003
IEEE
14 years 1 months ago
2003
IEEE
— Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute-like methods have led s...
ALGORITHMICA
1998
13 years 7 months ago
1998
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...