Publisher
Springer International Publishing
Reference33 articles.
1. Barman, D., Bhattacharya, S., Sarkar, R., & Chowdhury, N. (2019). k-context technique: A method for identifying dense subgraphs in a heterogeneous information network. IEEE Transactions on Computational Social Systems, 6(6), 1190–1205.
2. Batagelj, V., & Zaversnik, M. (2003). An o (m) algorithm for cores decomposition of networks. arXiv preprint cs/0310049.
3. Boden, B., Günnemann, S., Hoffmann, H., & Seidl, T. (2012). Mining coherent subgraphs in multi-layer graphs with edge labels. In SIGKDD (pp. 1258–1266). ACM.
4. Boden, B., Günnemann, S., Hoffmann, H., & Seidl, T. (2017). Mimag: Mining coherent subgraphs in multi-layer graphs with edge labels. Knowledge and Information Systems, 50(2), 417–446.
5. Bron, C., & Kerbosch, J. (1973). Algorithm 457: Finding all cliques of an undirected graph. Communications of the ACM, 16(9), 575–576.