Research Article

Keywords-Driven and Popularity-Aware Paper Recommendation Based on Undirected Paper Citation Graph

Algorithm 1

Tree growth.
Input: K = {}
Output: Q1
(1)For each u ∈  do
(2)  If 1 +  < 
(3)    = 1 + 
(4)   
(5)   enqueue into Q1
(6)   update Q1
(7)  End If
(8)  If
(9)    +  < 
(10)    =  + 
(11)   enqueue into Q1
(12)   update Q1
(13)  End If
(14)  Return Q1
(15)End For