Online force-directed algorithms for visualization of dynamic graphs-Reference-Cited by-同舟云学术

Online force-directed algorithms for visualization of dynamic graphs

Published:2021-05 Issue: Volume:556 Page:223-255
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Cheong Se-Hang,Si Yain-Whar,Wong Raymond K.

Funder

Universidade de Macau

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference44 articles.

1. Graph drawing by force-directed placement;Fruchterman;Software: Practice and Experience,1991

2. An energy model for visual graph clustering;Noack,2003

3. An algorithm for drawing general undirected graphs;Kamada;Information Processing Letters,1989

4. Drawing graphs nicely using simulated annealing;Davidson;ACM Transactions on Graphics (TOG),1996

5. Forceatlas2, a continuous graph layout algorithm for handy network visualization designed for the gephi software;Jacomy;PloS one,2014

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. SciDG: Benchmarking Scientific Dynamic Graph Queries;35th International Conference on Scientific and Statistical Database Management;2023-07-10

2. The State of the Art in Visualizing Dynamic Multivariate Networks;Computer Graphics Forum;2023-06

3. Adaptive-Correlation-aware Unsupervised Deep Learning for Anomaly Detection in Cyber-physical Systems;IEEE Transactions on Dependable and Secure Computing;2023

4. Introduction to the Class of Prefractal Graphs;Mathematics;2022-07-18

5. Stable structural clustering in uncertain graphs;Information Sciences;2022-03