32 search results - page 7 / 7 » Vertex Partitions by Connected Monochromatic k-Regular Graph... |
KDD
2007
ACM
14 years 5 months ago
2007
ACM
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...