3206 search results - page 153 / 642 » Optimizing Graph Algorithms for Improved Cache Performance |
152
click to vote
VLDB
1999
ACM
15 years 7 months ago
1999
ACM
Recent high-performance processors employ sophisticated techniques to overlap and simultaneously execute multiple computation and memory operations. Intuitively, these techniques ...
117
Voted
JACM
2010
15 years 1 months ago
2010
We present a linear expected time algorithm for finding maximum cardinality matchings in sparse random graphs. This is optimal and improves on previous results by a logarithmic f...
FMCAD
2000
Springer
15 years 6 months ago
2000
Springer
We present a symbolic algorithm for strongly connected component decomposition. The algorithm performs (n log n) image and preimage computations in the worst case, where n is the n...
148
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We continue the line of research on graph compression started in [BV04], but we move our focus to the compression of social networks in a proper sense (e.g., LiveJournal): the app...
117
click to vote
CHI
2008
ACM
15 years 5 months ago
2008
ACM
Hierarchical menus are now ubiquitous. The performance of the menu depends on many factors: structure, layout, colors and so on. There has been extensive research on novel menus, ...