These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
22. 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]
23. A clustering-based graph Laplacian framework for value function approximation in reinforcement learning. Xu X; Huang Z; Graves D; Pedrycz W IEEE Trans Cybern; 2014 Dec; 44(12):2613-25. PubMed ID: 24802018 [TBL] [Abstract][Full Text] [Related]
24. New Markov-Shannon Entropy models to assess connectivity quality in complex networks: from molecular to cellular pathway, Parasite-Host, Neural, Industry, and Legal-Social networks. Riera-Fernández P; Munteanu CR; Escobar M; Prado-Prado F; Martín-Romalde R; Pereira D; Villalba K; Duardo-Sánchez A; González-Díaz H J Theor Biol; 2012 Jan; 293():174-88. PubMed ID: 22037044 [TBL] [Abstract][Full Text] [Related]
25. Laplacian Estrada and normalized Laplacian Estrada indices of evolving graphs. Shang Y PLoS One; 2015; 10(3):e0123426. PubMed ID: 25822506 [TBL] [Abstract][Full Text] [Related]
26. A graph-based evolutionary algorithm: Genetic Network Programming (GNP) and its extension using reinforcement learning. Mabu S; Hirasawa K; Hu J Evol Comput; 2007; 15(3):369-98. PubMed ID: 17705783 [TBL] [Abstract][Full Text] [Related]
27. Edge compression techniques for visualization of dense directed graphs. Dwyer T; Henry Riche N; Marriott K; Mears C IEEE Trans Vis Comput Graph; 2013 Dec; 19(12):2596-605. PubMed ID: 24051826 [TBL] [Abstract][Full Text] [Related]
28. Exponential random graph model parameter estimation for very large directed networks. Stivala A; Robins G; Lomi A PLoS One; 2020; 15(1):e0227804. PubMed ID: 31978150 [TBL] [Abstract][Full Text] [Related]
29. Graph Matching Based on Stochastic Perturbation. Leng C; Xu W; Cheng I; Basu A IEEE Trans Image Process; 2015 Dec; 24(12):4862-75. PubMed ID: 26292343 [TBL] [Abstract][Full Text] [Related]
30. Graph Estimation From Multi-Attribute Data. Kolar M; Liu H; Xing EP J Mach Learn Res; 2014 May; 15(May):1713-1750. PubMed ID: 25620892 [TBL] [Abstract][Full Text] [Related]
31. Penalized likelihood methods for estimation of sparse high-dimensional directed acyclic graphs. Shojaie A; Michailidis G Biometrika; 2010 Sep; 97(3):519-538. PubMed ID: 22434937 [TBL] [Abstract][Full Text] [Related]
32. Searching for nodes in random graphs. Lancaster D Phys Rev E Stat Nonlin Soft Matter Phys; 2011 Nov; 84(5 Pt 2):056107. PubMed ID: 22181473 [TBL] [Abstract][Full Text] [Related]
33. Estimating Graph Robustness Through the Randic Index. De Meo P; Messina F; Rosaci D; Sarne GML; Vasilakos AV IEEE Trans Cybern; 2018 Nov; 48(11):3232-3242. PubMed ID: 29990094 [TBL] [Abstract][Full Text] [Related]
34. Martingales and the fixation probability of high-dimensional evolutionary graphs. Monk T J Theor Biol; 2018 Aug; 451():10-18. PubMed ID: 29727631 [TBL] [Abstract][Full Text] [Related]
36. Multiclass Data Segmentation Using Diffuse Interface Methods on Graphs. Garcia-Cardona C; Merkurjev E; Bertozzi AL; Flenner A; Percus AG IEEE Trans Pattern Anal Mach Intell; 2014 Aug; 36(8):1600-13. PubMed ID: 26353341 [TBL] [Abstract][Full Text] [Related]
37. Components in time-varying graphs. Nicosia V; Tang J; Musolesi M; Russo G; Mascolo C; Latora V Chaos; 2012 Jun; 22(2):023101. PubMed ID: 22757508 [TBL] [Abstract][Full Text] [Related]
38. On the spectrum, energy and Laplacian energy of graphs with self-loops. Preetha P U; Suresh M; Bonyah E Heliyon; 2023 Jul; 9(7):e17001. PubMed ID: 37415950 [TBL] [Abstract][Full Text] [Related]
39. Fitness landscapes, memetic algorithms, and greedy operators for graph bipartitioning. Merz P; Freisleben B Evol Comput; 2000; 8(1):61-91. PubMed ID: 10753231 [TBL] [Abstract][Full Text] [Related]