Aug 2026
BH-tsNET, FIt-tsNET, and L-tsNET: Fast tsNET Algorithms for Large Graph Drawing.
Three fast algorithms for reducing the time complexity of tsNET algorithm from O(nm) time to O(nlogn) time and O(n) time are presented and a comparison between these algorithms and DRGraph, another dimension reduction-based graph drawing algorithm is presented.
Amyra Meidiana, Seok-Hee Hong, Kwan-Liu Ma
· IEEE Transactions on Visuali... · 0 citations