169 related articles for article (PubMed ID: 37368896)
1. Graph drawing using Jaya.
Dib FK; Rodgers P
PLoS One; 2023; 18(6):e0287744. PubMed ID: 37368896
[TBL] [Abstract][Full Text] [Related]
2. Graph drawing using tabu search coupled with path relinking.
Dib FK; Rodgers P
PLoS One; 2018; 13(5):e0197103. PubMed ID: 29746576
[TBL] [Abstract][Full Text] [Related]
3. Optimization design of brushless DC motor based on improved JAYA algorithm.
Cheng Y; Lyu X; Mao S
Sci Rep; 2024 Mar; 14(1):5427. PubMed ID: 38443425
[TBL] [Abstract][Full Text] [Related]
4. Accelerating network layouts using graph neural networks.
Both C; Dehmamy N; Yu R; Barabási AL
Nat Commun; 2023 Mar; 14(1):1560. PubMed ID: 36944640
[TBL] [Abstract][Full Text] [Related]
5. Visual exploration of complex time-varying graphs.
Kumar G; Garland M
IEEE Trans Vis Comput Graph; 2006; 12(5):805-12. PubMed ID: 17080803
[TBL] [Abstract][Full Text] [Related]
6. fCoSE: A Fast Compound Graph Layout Algorithm with Constraint Support.
Balci H; Dogrusoz U
IEEE Trans Vis Comput Graph; 2022 Dec; 28(12):4582-4593. PubMed ID: 34232882
[TBL] [Abstract][Full Text] [Related]
7. An efficient biological pathway layout algorithm combining grid-layout and spring embedder for complicated cellular location information.
Kojima K; Nagasaki M; Miyano S
BMC Bioinformatics; 2010 Jun; 11():335. PubMed ID: 20565884
[TBL] [Abstract][Full Text] [Related]
8. Graph Exploration With Embedding-Guided Layouts.
Shen L; Tai Z; Shen E; Wang J
IEEE Trans Vis Comput Graph; 2024 Jul; 30(7):3693-3708. PubMed ID: 37022062
[TBL] [Abstract][Full Text] [Related]
9. What Would a Graph Look Like in this Layout? A Machine Learning Approach to Large Graph Visualization.
Kwon OH; Crnovrsanin T; Ma KL
IEEE Trans Vis Comput Graph; 2018 Jan; 24(1):478-488. PubMed ID: 28866499
[TBL] [Abstract][Full Text] [Related]
10. Evaluating the Readability of Force Directed Graph Layouts: A Deep Learning Approach.
Haleem H; Wang Y; Puri A; Wadhwa S; Qu H
IEEE Comput Graph Appl; 2019; 39(4):40-53. PubMed ID: 31226059
[TBL] [Abstract][Full Text] [Related]
11. Online dynamic graph drawing.
Frishman Y; Tal A
IEEE Trans Vis Comput Graph; 2008; 14(4):727-40. PubMed ID: 18467750
[TBL] [Abstract][Full Text] [Related]
12. Event-Based Dynamic Graph Visualisation.
Simonetto P; Archambault D; Kobourov S
IEEE Trans Vis Comput Graph; 2020 Jul; 26(7):2373-2386. PubMed ID: 30575538
[TBL] [Abstract][Full Text] [Related]
13. Graph Drawing Aesthetics-Created by Users, Not Algorithms.
Purchase HC; Pilcher C; Plimmer B
IEEE Trans Vis Comput Graph; 2012 Jan; 18(1):81-92. PubMed ID: 21173454
[TBL] [Abstract][Full Text] [Related]
14. Key-Node-Separated Graph Clustering and Layouts for Human Relationship Graph Visualization.
Itoh T; Klein K
IEEE Comput Graph Appl; 2015; 35(6):30-40. PubMed ID: 26415161
[TBL] [Abstract][Full Text] [Related]
15. A Deep Generative Model for Graph Layout.
Kwon OH; Ma KL
IEEE Trans Vis Comput Graph; 2020 Jan; 26(1):665-675. PubMed ID: 31425108
[TBL] [Abstract][Full Text] [Related]
16. AmbiguityVis: Visualization of Ambiguity in Graph Layouts.
Wang Y; Shen Q; Archambault D; Zhou Z; Zhu M; Yang S; Qu H
IEEE Trans Vis Comput Graph; 2016 Jan; 22(1):359-68. PubMed ID: 26390486
[TBL] [Abstract][Full Text] [Related]
17. Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs.
Kundeti VK; Rajasekaran S; Dinh H; Vaughn M; Thapar V
BMC Bioinformatics; 2010 Nov; 11():560. PubMed ID: 21078174
[TBL] [Abstract][Full Text] [Related]
18. Intelligent Graph Layout Using Many Users' Input.
Yuan X; Che L; Hu Y; Zhang X
IEEE Trans Vis Comput Graph; 2012 Dec; 18(12):2699-708. PubMed ID: 26357179
[TBL] [Abstract][Full Text] [Related]
19. DeepDrawing: A Deep Learning Approach to Graph Drawing.
Wang Y; Jin Z; Wang Q; Cui W; Ma T; Qu H
IEEE Trans Vis Comput Graph; 2020 Jan; 26(1):676-686. PubMed ID: 31443020
[TBL] [Abstract][Full Text] [Related]
20. Uncluttering graph layouts using anisotropic diffusion and mass transport.
Frishman Y; Tal A
IEEE Trans Vis Comput Graph; 2009; 15(5):777-88. PubMed ID: 19590104
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
