Community detection and evaluation is an important task in graph mining. In many cases community is defined as a subgraph characterized by dense connections or interactions among its nodes. A large variety of measures have been proposed to evaluate the quality of such communities - in most cases ignoring the directed nature of edges. In this paper, we introduce the novel D-core concept, extending the classic graph-theoretic k-core for undirected graphs to directed ones, as means of evaluating their collaborative nature - a property not captured by the single node metrics or by the established community evaluation metrics. Based on the Dcore, which essentially measures the robustness of a community under degeneracy, we devise a wealth of novel metrics used to evaluate the individuals of the DBLP graph.

Bellow you can test a demo of our work.

Type in the name of the Author:

(simple search for now so be carefull on the spelling)

Disclaimer: the data used for these results are taken from DBLP and are probably not complete.