This is a collection of the codes on the nucleus decomposition framework.

• 'nd' has the basic nucleus decomposition[1] and hierarchy construction[2] codes.
• 'bnd' has the tip and wing decompositions for bipartite networks[3] along with the hierarchy contructions
• 'pnd' has the parallel nucleus decomposition algorithms[4], based on the h-index formulation -- no hierarchy construction exists
• 'dnd' has the directed 2,3 nucleus decomposition algorithms

[1] Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions
A. Erdem Sariyuce, C. Seshadhri, Ali Pinar, Umit V. Catalyürek
International World Wide Web Conference (WWW), 2015, pdf

[2] Fast Hierarchy Construction for Dense Subgraphs
A. Erdem Sariyuce, Ali Pinar
International Conference on Very Large Data Bases (VLDB), 2017, pdf

[3] Peeling Bipartite Networks for Dense Subgraph Discovery
A. Erdem Sariyuce, Ali Pinar
arXiv:1611.02756

[4] Parallel Local Algorithms for Core, Truss, and Nucleus Decompositions
A. Erdem Sariyuce, C. Seshadhri, Ali Pinar
arXiv:1704.00386