BH-tsNET, FIt-tsNET, and L-tsNET: Fast tsNET Algorithms for Large Graph Drawing.

Meidiana A, Hong SH, Ma KL

Open source

DOI
10.1109/tvcg.2026.3727643
Published
2026 Aug 25
Container
IEEE transactions on visualization and computer graphics
Publisher
Not recorded
Open access
unknown

Credibility signals

limited evidence Score 43/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1109/tvcg.2026.3727643,
  title = {BH-tsNET, FIt-tsNET, and L-tsNET: Fast tsNET Algorithms for Large Graph Drawing.},
  author = {Meidiana A and Hong SH and Ma KL},
  year = {2026},
  journal = {IEEE transactions on visualization and computer graphics},
  doi = {10.1109/tvcg.2026.3727643},
  url = {https://doi.org/10.1109/tvcg.2026.3727643}
}

RIS

TY  - JOUR
TI  - BH-tsNET, FIt-tsNET, and L-tsNET: Fast tsNET Algorithms for Large Graph Drawing.
AU  - Meidiana A
AU  - Hong SH
AU  - Ma KL
PY  - 2026
JO  - IEEE transactions on visualization and computer graphics
DO  - 10.1109/tvcg.2026.3727643
UR  - https://doi.org/10.1109/tvcg.2026.3727643
ER  - 

APA

A, M., SH, H., & KL, M. (2026). BH-tsNET, FIt-tsNET, and L-tsNET: Fast tsNET Algorithms for Large Graph Drawing.. IEEE transactions on visualization and computer graphics. https://doi.org/10.1109/tvcg.2026.3727643

Source records