Effective “static-graph” reorganization to improve locality in garbage-collected systems
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
A spectral algorithm for envelope reduction of sparse matrices
Proceedings of the 1993 ACM/IEEE conference on Supercomputing
A graph-based system for network-vulnerability analysis
Proceedings of the 1998 workshop on New security paradigms
Efficient identification of Web communities
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Studying Recommendation Algorithms by Graph Analysis
Journal of Intelligent Information Systems
Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Reducing the bandwidth of sparse symmetric matrices
ACM '69 Proceedings of the 1969 24th national conference
Memory Hierarchy Management for Iterative Graph Structures
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Optimizing Graph Algorithms for Improved Cache Performance
IEEE Transactions on Parallel and Distributed Systems
Journal of Experimental Algorithmics (JEA)
Partitioning of Web graphs by community topology
WWW '05 Proceedings of the 14th international conference on World Wide Web
Exploiting Locality for Irregular Scientific Codes
IEEE Transactions on Parallel and Distributed Systems
Extraction and classification of dense communities in the web
Proceedings of the 16th international conference on World Wide Web
Dex: high-performance exploration on large graphs for information retrieval
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Survey of graph database models
ACM Computing Surveys (CSUR)
BIBEX: a bibliographic exploration tool based on the DEX graph query engine
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Statistical properties of community structure in large social and information networks
Proceedings of the 17th international conference on World Wide Web
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
Bioinformatics
User position measures in social networks
Proceedings of the 3rd Workshop on Social Network Mining and Analysis
Shaping communities out of triangles
Proceedings of the 21st ACM international conference on Information and knowledge management
| Hi-index | 0.00 |
Graphs provide a natural data representation for analyzing the relationships among entities in many application areas. Since the analysis algorithms perform memory intensive operations, it is important that the graph layout is adapted to take advantage of the memory hierarchy. Here, we propose layout strategies based on community detection to improve the in-memory data locality of generic graph algorithms. We conclude that the detection of communities in a graph provides a layout strategy that improves the performance of graph algorithms consistently over other state of the art strategies.