It should be noted that implementing a sound comparison was rather complex as it required testing all the algorithms in the same conditions and optimally setting their parameters.
lSSVM and lSP adopt different graph models and use different methods to extract spanning trees from a document graph, namely, Kruskal's (Kruskal, 1956) and Edmonds' (Chu and liu, 1965;Edmonds, 1967).