N. C. , Edge-disjoint spanning trees of finite graphs, Journal of the London Mathematical Society, issue.1, pp.445-450, 1961.

M. Almasri, O. Anjum, C. Pearson, Z. Qureshi, V. S. Mailthody et al., Update on k-truss decomposition on gpu, 2019 IEEE High Performance Extreme Computing Conference (HPEC), pp.1-7, 2019.

N. Alon, R. Yuster, and U. Zwick, Finding and counting given length cycles, Algorithmica, vol.17, issue.3, pp.209-223, 1997.

J. I. Alvarez-hamelin, L. Dall'asta, A. Barrat, and A. Vespignani, Large scale networks fingerprinting and visualization using the k-core decomposition, Advances in neural information processing systems, pp.41-50, 2006.

M. Bisson and M. Fatica, Static graph challenge on GPU, 2017 IEEE High Performance Extreme Computing Conference (HPEC), pp.1-8, 2017.

P. Boldi, A. Marino, M. Santini, and S. Vigna, Bubing: Massive crawling for the masses, TWEB, vol.12, issue.2, 2018.

P. Boldi and S. Vigna, The webgraph framework i: Compression techniques, 13th International Conference on World Wide Web, WWW '04, pp.595-602, 2004.

P. Chen, C. Chou, and M. Chen, Distributed algorithms for ktruss decomposition, 2014 IEEE International Conference on, pp.471-480, 2014.

N. Chiba and T. Nishizeki, Arboricity and subgraph listing algorithms, SIAM Journal on Computing, vol.14, issue.1, pp.210-223, 1985.

J. Cohen, Trusses: Cohesive subgraphs for social network analysis, National Security Agency Technical Report, vol.16, 2008.

A. Conte, D. De, R. Sensi, A. Grossi, L. Marino et al., Discovering $k$-trusses in large-scale networks, 2018 IEEE High Performance Extreme Computing Conference, pp.1-6, 2018.

A. Conte, R. D. Virgilio, A. Maccioni, M. Patrignani, and R. Torlone, Finding all maximal cliques in very large social networks, 9th International Conference on Extending Database Technology, EDBT 2016, pp.173-184, 2016.

T. A. Davis, Graph algorithms via suitesparse: Graphblas: triangle counting and k-truss, 2018 IEEE High Performance extreme Computing Conference (HPEC), pp.1-6, 2018.

Y. Fang, R. Cheng, S. Luo, and J. Hu, Effective community search for large attributed graphs, Proc. VLDB Endow, vol.9, pp.1233-1244, 2016.

M. Farach-colton and M. Tsai, Computing the degeneracy of large graphs, LATIN 2014: Theoretical Informatics -11th Latin American Symposium, pp.250-260, 2014.

C. Giatsidis, F. D. Malliaros, D. M. Thilikos, and M. Vazirgiannis, Corecluster: A degeneracy based graph clustering framework, AAAI, vol.14, pp.44-50, 2014.
URL : https://hal.archives-ouvertes.fr/lirmm-01083536

O. Green, J. Fox, E. Kim, F. Busato, N. Bombieri et al., Quickly finding a truss in a haystack, High Performance Extreme Computing Conference (HPEC), 2017 IEEE, pp.1-7, 2017.

X. Huang, H. Cheng, L. Qin, W. Tian, and J. X. Yu, Querying ktruss community in large and dynamic graphs, ACM SIGMOD international conference on Management of data, pp.1311-1322, 2014.

H. Kabir and K. Madduri, Parallel k-truss decomposition on multicore systems, High Performance Extreme Computing Conference (HPEC), 2017 IEEE, pp.1-7, 2017.

R. Li, L. Qin, J. X. Yu, and R. Mao, Influential community search in large networks, Proc. VLDB Endow, vol.8, pp.509-520, 2015.

T. M. Low, D. G. Spampinato, A. Kutuluru, U. Sridhar, D. T. Popovici et al., Linear algebraic formulation of edgecentric k-truss algorithms with adjacency matrices, 2018 IEEE High Performance extreme Computing Conference (HPEC), pp.1-7, 2018.

V. S. Mailthody, K. Date, Z. Qureshi, C. Pearson, R. Nagi et al., Collaborative (CPU + GPU) algorithms for triangle counting and truss decomposition, 2018 IEEE High Performance Extreme Computing Conference, HPEC, pp.1-7, 2018.

/. Mit/amazon, . Ieee, and . Graphchallenge, org: Raising the bar on graph analytic performance, 2017.

R. Pearce, Triangle counting for scale-free graphs at scale in distributed memory, 2017 IEEE High Performance Extreme Computing Conference (HPEC), pp.1-4, 2017.

R. Pearce and G. Sanders, K-truss decomposition for scale-free graphs at scale in distributed memory, 2018 IEEE High Performance extreme Computing Conference (HPEC), pp.1-6, 2018.

M. G. Rossi, F. D. Malliaros, and M. Vazirgiannis, Spread it good, spread it fast: Identification of influential nodes in social networks, 24th International Conference on World Wide Web, pp.101-102, 2015.

S. Samsi, V. Gadepally, M. B. Hurley, M. Jones, E. K. Kao et al., Graphchallenge.org: Raising the bar on graph analytic performance, IEEE High Performance Extreme Computing Conference, HPEC, pp.1-7, 2018.

S. Smith, X. Liu, N. K. Ahmed, A. S. Tom, F. Petrini et al., Truss decomposition on shared-memory parallel systems, 2017 IEEE High Performance Extreme Computing Conference (HPEC), pp.1-6, 2017.

E. Tomita and T. Kameda, An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments, Journal of Global Optimization, vol.37, issue.1, pp.95-111, 2007.

C. Voegele, Y. S. Lu, S. Pai, and K. Pingali, Parallel triangle counting and k-truss identification using graph-centric methods, 2017 IEEE High Performance Extreme Computing Conference (HPEC), pp.1-7, 2017.

J. Wang and J. Cheng, Truss decomposition in massive networks, VLDB Endowment, vol.5, issue.9, pp.812-823, 2012.

Y. Wang, S. Cai, and M. Yin, Two efficient local search algorithms for maximum weight clique problem, AAAI, pp.805-811, 2016.

D. Wen, L. Qin, X. Lin, Y. Zhang, and L. Chang, Enumerating k-vertex connected components in large graphs, 2017.

V. V. Williams and R. Williams, Subcubic equivalences between path, matrix and triangle problems, Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on, pp.645-654, 2010.

M. M. Wolf, M. Deveci, J. W. Berry, S. D. Hammond, and S. Rajamanickam, Fast linear algebra-based triangle counting with KokkosKernels, 2017 IEEE High Performance Extreme Computing Conference (HPEC), pp.1-7, 2017.

J. Wu, A. Goshulak, V. Srinivasan, and A. Thomo, K-truss decomposition of large networks on a single consumer-grade machine, IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), vol.00, pp.873-880, 2018.