The following algorithms experimented in this paper are named pivotMDS, PivotMDs(k), Maxent(k), sfdp, GRIP, and FSM (full stress model).
SFDP and GRIP are particularly impressive for visualization and factorization of large graphs, compared with standard spanning tree algorithms.
It would be a significant step beyond to find them implemented as plugins for gephi.Statistics:Posted by cthovex — 14 May 2013 19:37
]]>