Affiliation:
1. Universitat Politècnica de Catalunya, Spain
Abstract
In this chapter, we review different graph implementation alternatives that have been proposed in the literature. Our objective is to provide the readers with a broad set of alternatives to implement a graph, according to their needs. We pay special attention to the techniques that enable the management of large graphs. We also include a description of the most representative libraries available for representing graphs.
Reference62 articles.
1. S. Memory hierarchy management for iterative graph structures;I.Al-Furaih;IPPS/SPDP,1998
2. Alpert, C. J. & Kahng, (1995). A. B. Recent directions in Net list partitioning: A Survey. Integr. VLSI J., 19(1-2), 1–81.
3. Andreev, K., & Räcke, H. (2004). Balanced graph partitioning. In ACM symposium on Parallelism in algorithms and architectures, pages 120—124.
4. Q2L: Towards support for sub graph extraction queries in rdf databases;K.Anyanwu;ACM WWW,2007
5. Arora, S., Rao, S., & Vazirani, U. (2004). Expander flows, geometric embeddings and graph partitioning. In ACM symposium on Theory of computing, pages 222–231.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献