A. Volovich and H. , Partouche Barak Kol Shmuel Elitzur Shmuel Elitzur A

G. Ferretti, A. Bilal, S. P. De-alwis-steven, B. Giddings-steven, and B. , Giddings generator. Moreover, we offer an alternative visualization of the differential behavior of the graphs under concern with regard to the pace of graph size reduction for both the inlinks and the outlinks aspect and conduct an exhaustive study and interpretation of the in-/outdegree distributions in the synthetic preferential attachment datasets. Finally, we conduct an extensive experimental evaluation for scale-free/preferential attachment synthetic graphs as well as real-world large-scale directed graphs: the (English) Wikipedia?2004 edition, the ArXiv, and DBLP citation graphs. We computed and explored the respective D-cores matrices, frontiers, and metrics, and we derived interesting results and observations both References 1 A graph-theoretic definition of a sociometric clique, Alba RD J Math Sociol, vol.3, pp.113-126, 1973.

J. Alvarez-hamelin, L. Dall-'asta, A. Barrat, and A. Vespignani, ) k-core decomposition: a tool for the visualization of large scale networks, p.504107, 2005.

J. 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.

Y. An, J. Janssen, and E. Milios, Characterizing and Mining the Citation Graph of the Computer Science Literature, Knowledge and Information Systems, vol.393, issue.6, pp.664-678, 2004.
DOI : 10.1007/s10115-003-0128-3

G. Bader and C. Hogue, An automated method for finding molecular complexes in large protein interaction networks, BMC Bioinformat, vol.4, pp.1-1, 2003.

A. Barabási and A. R. , Emergence of scaling in random networks, Science, vol.286, pp.509-512, 1999.

A. Barabási, R. Albert, and H. Jeong, Scale-free characteristics of random networks: the topology of the world-wide web, Physica A: Statistical Mechanics and its Applications, vol.281, issue.1-4, pp.69-77, 2000.
DOI : 10.1016/S0378-4371(00)00018-2

V. Batagelj and A. Mrvar, Pajek?analysis and visualization of large networks, Graph Drawing, pp.8-11, 2002.

V. Batagelj and M. Zaversnik, Generalized cores. CoRR, cs, 2002.

M. Baur, M. Gaertler, R. Görke, M. Krug, and D. Wagner, Generating graphs with predefined k-core structure, Proceedings of the European conference of complex systems (ECCS'07), 2007.

B. Bollobas, C. Borgs, J. Chayes, and O. Riordan, Directed scale-free graph, Proceedings of 14th ACM-SIAM symposium on discrete algorithms, pp.132-139, 2003.

B. Bollobás and O. Riordan, The Diameter of a Scale-Free Random Graph, Combinatorica, vol.24, issue.1, pp.5-34, 2004.
DOI : 10.1007/s00493-004-0002-2

B. Bollobs, O. Riordan, J. Spencer, and G. Tusnády, The degree sequence of a scale-free random graph process, Random Structures & Algorithms, vol.33, issue.3, pp.279-290, 2001.
DOI : 10.1002/rsa.1009

P. Buckley and D. Osthus, Popularity based random graph models leading to a scale-free degree sequence, Discrete Mathematics, vol.282, issue.1-3, pp.53-68, 2001.
DOI : 10.1016/j.disc.2003.10.020

S. Carmi, S. Havlin, S. Kirkpatrick, Y. Shavitt, and E. Shir, MEDUSA?new model of internet topology using k-shell decomposition, arXiv:cond-mat, 2006.

M. Charikar, Greedy Approximation Algorithms for Finding Dense Components in a Graph, Lecture Notes in Computer Science, pp.84-95, 1913.
DOI : 10.1007/3-540-44436-X_10

C. Cooper and A. Frieze, A general model of web graphs, Random Structures and Algorithms, vol.213, issue.3, pp.311-335, 2003.
DOI : 10.1002/rsa.10084

R. Diestel, Graph theory, volume 173 of Graduate texts in mathematics, 2005.

S. Dorogovtsev, A. Goltsev, and J. Mendes, -Core Organization of Complex Networks, Physical Review Letters, vol.96, issue.4, p.40601, 2006.
DOI : 10.1103/PhysRevLett.96.040601

S. Dorogovtsev, J. Mendes, and A. Samukhin, Structure of Growing Networks with Preferential Linking, Physical Review Letters, vol.85, issue.21, pp.4633-4636, 2000.
DOI : 10.1103/PhysRevLett.85.4633

E. Drinea, M. Enachescu, and M. Mitzenmacher, Variations on random graph models for the web, 2001.

P. Erd?-os, On the structure of linear graphs, Israel Journal of Mathematics, vol.10, issue.3, pp.156-160, 1963.
DOI : 10.1007/BF02759702

P. Erd?-os and A. Rényi, On the evolution of random graphs, Magyar Tud Akad Mat Kutató Int Közl, vol.5, pp.17-61, 1960.

M. Fershtman, Cohesive group detection in a social network by the segregation matrix index, Social Networks, vol.19, issue.3, pp.193-207, 1997.
DOI : 10.1016/S0378-8733(96)00295-X

S. Fortunato, Community detection in graphs, Physics Reports, vol.486, issue.3-5, pp.3-575, 2010.
DOI : 10.1016/j.physrep.2009.11.002

K. Frank, Identifying cohesive subgroups, Social Networks, vol.17, issue.1, pp.27-56, 1995.
DOI : 10.1016/0378-8733(94)00247-8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.493.5165

E. Freuder, A Sufficient Condition for Backtrack-Free Search, Journal of the ACM, vol.29, issue.1, pp.24-32, 1982.
DOI : 10.1145/322290.322292

C. Giatsidis, D. Thilikos, and M. Vazirgiannis, D-cores: Measuring Collaboration of Directed Graphs Based on Degeneracy, 2011 IEEE 11th International Conference on Data Mining, pp.201-210, 2011.
DOI : 10.1109/ICDM.2011.46
URL : https://hal.archives-ouvertes.fr/lirmm-00846768

C. Giatsidis, D. Thilikos, and M. Vazirgiannis, Evaluating Cooperation in Communities with the k-Core Structure, 2011 International Conference on Advances in Social Networks Analysis and Mining, pp.87-93, 2011.
DOI : 10.1109/ASONAM.2011.65

J. Healy, J. Janssen, E. Milios, and W. Aiello, Characterization of Graphs Using Degree Cores, 2008.
DOI : 10.1007/978-3-540-78808-9_13

V. Kandylas, S. Upham, and L. Ungar, Finding cohesive clusters for analyzing knowledge communities, Knowledge and Information Systems, vol.7, issue.2, pp.335-354, 2008.
DOI : 10.1007/s10115-008-0135-5

L. Kirousis and D. Thilikos, The Linkage of a Graph, SIAM Journal on Computing, vol.25, issue.3, pp.626-647, 1996.
DOI : 10.1137/S0097539793255709

R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins et al., Stochastic models for the Web graph, Proceedings 41st Annual Symposium on Foundations of Computer Science, p.57, 2000.
DOI : 10.1109/SFCS.2000.892065

R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins, Extracting large-scale knowledge bases from the web, VLDB '99: proceedings of the 25th international conference on very large data bases, pp.639-650, 1999.

D. Luce, Connectivity and generalized cliques in sociometric group structure, Psychometrika, vol.14, issue.2, pp.169-190, 1950.
DOI : 10.1007/BF02289199

D. Matula, A min-max theorem for graphs with application to graph coloring, SIAM Rev, vol.10, pp.481-482, 1968.

D. Matula, G. Marble, and J. Isaacson, Graph coloring algorithms In: Graph theory and computing, pp.109-122, 1972.

J. Moody and D. White, Structural Cohesion and Embeddedness: A Hierarchical Concept of Social Groups, American Sociological Review, vol.68, issue.1, pp.103-127, 2007.
DOI : 10.2307/3088904

S. Papadimitriou, J. Sun, C. Faloutsos, and P. Yu, Hierarchical, Parameter-Free Community Discovery, ECML/PKDD (2), pp.170-187, 2008.
DOI : 10.1007/978-3-540-87481-2_12
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.163.520

B. Pittel, J. Spencer, and N. Wormald, Sudden Emergence of a Giantk-Core in a Random Graph, Journal of Combinatorial Theory, Series B, vol.67, issue.1, pp.111-151, 1996.
DOI : 10.1006/jctb.1996.0036

S. Seidman, Network structure and minimum degree, Social Networks, vol.5, issue.3, pp.269-287, 1983.
DOI : 10.1016/0378-8733(83)90028-X

G. Szekeres and H. Wilf, An inequality for the chromatic number of a graph, Journal of Combinatorial Theory, vol.4, issue.1, pp.1-3, 1968.
DOI : 10.1016/S0021-9800(68)80081-X

S. Wasserman and K. Faust, Social networks analysis: methods and applications, 1994.
DOI : 10.1017/CBO9780511815478

S. Wuchty and E. Almaas, Peeling the yeast protein network, PROTEOMICS, vol.406, issue.2, pp.444-449, 2005.
DOI : 10.1002/pmic.200400962