2.5 Dalibor Fiala et al. (2008) [11] in this paper, we present several modifications of the classical Pagerank formula adapted for bibliographic networks. These Pagerank take into account not only the citation but also the co-authorship graph. Counting citations of research publications is a relatively objective manner to determine quality research known since a long time ago. With the fast growth of the World Wide Web in the past ten years, this kind of analysis has become essential also in this domain in which links between Web pages may serve as citations. Therefore, current Web search engines make use of various link-based quality ranking algorithms Gvs (2005) and LANGVILLE (2003) review the latest developments of Pagerank thoroughly. This recursive algorithm is applicable to any directed graph. However, bibliographic data usually offers more than just citations. Collaboration networks are also a valuable source of information and are often studied. In the following sections, we present several modifications of the classical Pagerank formula adapted for bibliographic networks.
