A citation network is a graph in which nodes are the publications. There exists and edge between two nodes whenever one publication cites another. Studying the structure and dynamics of those networks might provide valuable insight into the nature of
the relationships among different research fields in computer science.
In addition, the availability of large citation data sets in a machine readable form creates an opportunity for developing algorithms that could aid humans in finding, sorting and filtering large amounts of infromation.
The problem that is the focus of this paper is clustering the set of publications into disjoint subsets that are somehow realted with each other. More specifically, given a set of seed nodes we would like to divide the nodes of the citation graph into contiguous partitions each conating exactly one seed node and publications related to that seed node.