D-cores: Measuring collaboration of directed graphs based on degeneracy

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2011, Pages 201-210

  Giatsidis, Christos ^a   Thilikos, Dimitrios M ^c   Vazirgiannis, Michalis ^a,b  

^a ÉCOLE POLYTECHNIQUE   (France)

^b ATHENS UNIVERSITY OF ECONOMICS AND BUSINESS   (Greece)

^c UNIVERSITY OF ATHENS   (Greece)

Author keywords

Community evaluation metrics; Cores; Degeneracy; Graph mining

Indexed keywords

COMMUNITY DETECTION; COMMUNITY IS; CORES; DEGENERACY; EVALUATION METRICS; GRAPH MINING; GRAPH-THEORETIC; K-CORES; REAL-WORLD GRAPHS; SUBGRAPHS; UNDIRECTED GRAPH; WIKIPEDIA;

CORE LEVELS; DATA MINING; QUALITY CONTROL;

DIRECTED GRAPHS;

EID: 84857156997     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2011.46     Document Type: Conference Paper

References (21)

1. R. D. Alba. A graph-theoretic definition of a sociometric clique. Journal of Mathematical Sociology 3:113-26, 1973.
2. V. Batagelj and M. Zaversnik. Generalized cores. CoRR, cs.DS/0202039, 2002.
3. M. Charikar. Greedy approximation algorithms for finding dense components in a graph. In Approximation algorithms for combinatorial optimization (Saarbrücken, 2000), volume 1913 of Lecture Notes in Comput. Sci., pages 84-95. Springer, Berlin, 2000.
4. R. Diestel. Graph theory, volume 173 of Graduate Texts in Mathematics. Springer-Verlag, Berlin, third edition, 2005.
5. P. Erdos. On the structure of linear graphs. Israel J. Math., 1:156-160, 1963.
6. P. Erdos and A. Rényi. On the evolution of random graphs. Magyar Tud. Akad. Mat. Kutató Int. Közl., 5:17-61, 1960.
7. M. Fershtman. Cohesive group detection in a social network by the segregation matrix index. Social Networks 19:193-207, 1997.
8. S. Fortunato. Community detection in graphs. Phys. Rep., 486(3-5):75-174, 2010.
9. K. A. Frank. Identifying cohesive subgroups. Social Networks 17:27-56, 1995.
10. E. C. Freuder. A sufficient condition for backtrack-free search. J. Assoc. Comput. Mach., 29(1):24-32, 1982.
11. C. Giatsidis, D. M. Thilikos, and M. Vazirgiannis. Evaluating cooperation in communities with the k-core structure. In International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2011, pages 87-93, 2011.
12. L. M. Kirousis and D. M. Thilikos. The linkage of a graph. SIAM J. Comput., 25(3):626-647, 1996.
13. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Extracting large-scale knowledge bases from the web. In VLDB '99: Proceedings of the 25th International Conference on Very Large Data Bases, pages 639-650, San Francisco, CA, USA, 1999. Morgan Kaufmann Publishers Inc.
14. D. Luce. Connectivity and generalized cliques in sociometric group structure. Psychometrika 15:169-90, 1950.
15. D. W. Matula. A min-max theorem for graphs with application to graph coloring. SIAM Reviews, 10:481-482, 1968.
16. D. W. Matula, G. Marble, and J. D. Isaacson. Graph coloring algorithms. In Graph theory and computing, pages 109-122. Academic Press, New York, 1972.
17. J. Moody and D. R. White. Structural cohesion and embeddedness: A hierarchical concept of social groups. American Sociological Review 68(1):103-127., 2007.
18. S. Papadimitriou, J. Sun, C. Faloutsos, and P. S. Yu. Hierarchical, parameter-free community discovery. In ECML/PKDD (2), pages 170-187, 2008.
19. B. Pittel, J. Spencer, and N. Wormald. Sudden emergence of a giant k-core in a random graph. J. Combin. Theory Ser. B, 67(1):111-151, 1996.
20. G. Szekeres and H. S. Wilf. An inequality for the chromatic number of a graph. J. Combinatorial Theory, 4:1-3, 1968.
21. S. Wasserman and K. Faust. Social Networks Analysis: Methods and Applications. Cambridge: Cambridge University Press., 1994.