Linear Heap Data Structures
Part of the Springer Series in the Data Sciences book series (SSDS)
In this chapter, we present linear heap data structures that will be useful in the remainder of the book for designing algorithms to efficiently process large sparse graphs.
- 7.Vladimir Batagelj and Matjaz Zaversnik. An o(m) algorithm for cores decomposition of networks. CoRR, cs.DS/0310049, 2003.Google Scholar
- 15.Lijun Chang, Wei Li, Xuemin Lin, Lu Qin, and Wenjie Zhang. pSCAN: Fast and exact structural graph clustering. In Proc. of ICDE’16, pages 253–264, 2016.Google Scholar
- 17.Lijun Chang, Jeffrey Xu Yu, Lu Qin, Xuemin Lin, Chengfei Liu, and Weifa Liang. Efficiently computing k-edge connected components via graph decomposition. In Proc. SIGMOD’13, pages 205–216, 2013.Google Scholar
- 24.Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms (3. ed.). MIT Press, 2009.Google Scholar
© Springer Nature Switzerland AG 2018