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.
204 related articles for article (PubMed ID: 25544654)
1. Dynamics of neural networks over undirected graphs. Goles E; Ruz GA Neural Netw; 2015 Mar; 63():156-69. PubMed ID: 25544654 [TBL] [Abstract][Full Text] [Related]
2. An annealed chaotic maximum neural network for bipartite subgraph problem. Wang J; Tang Z; Wang R Int J Neural Syst; 2004 Apr; 14(2):107-16. PubMed ID: 15112368 [TBL] [Abstract][Full Text] [Related]
3. Computational capabilities of graph neural networks. Scarselli F; Gori M; Tsoi AC; Hagenbuchner M; Monfardini G IEEE Trans Neural Netw; 2009 Jan; 20(1):81-102. PubMed ID: 19129034 [TBL] [Abstract][Full Text] [Related]
4. Maximum number of fixed points in regulatory Boolean networks. Aracena J Bull Math Biol; 2008 Jul; 70(5):1398-409. PubMed ID: 18306974 [TBL] [Abstract][Full Text] [Related]
5. Dynamical and complexity results for high order neural networks. Goles E; Matamala M Int J Neural Syst; 1994 Sep; 5(3):241-52. PubMed ID: 7866629 [TBL] [Abstract][Full Text] [Related]
6. Optimal competitive hopfield network with stochastic dynamics for maximum cut problem. Wang J; Tang Z; Cao Q; Wang R Int J Neural Syst; 2004 Aug; 14(4):257-65. PubMed ID: 15372703 [TBL] [Abstract][Full Text] [Related]
7. Efficient rewirings for enhancing synchronizability of dynamical networks. Rad AA; Jalili M; Hasler M Chaos; 2008 Sep; 18(3):037104. PubMed ID: 19045478 [TBL] [Abstract][Full Text] [Related]
8. Random graph models for directed acyclic networks. Karrer B; Newman ME Phys Rev E Stat Nonlin Soft Matter Phys; 2009 Oct; 80(4 Pt 2):046110. PubMed ID: 19905393 [TBL] [Abstract][Full Text] [Related]
9. On the limit cycle structure of threshold boolean networks over complete graphs. Voutsadakis G Int J Neural Syst; 2004 Jun; 14(3):209-15. PubMed ID: 15243953 [TBL] [Abstract][Full Text] [Related]
10. A hopfield network learning method for bipartite subgraph problem. Wang RL; Tang Z; Cao QP IEEE Trans Neural Netw; 2004 Nov; 15(6):1458-65. PubMed ID: 15565773 [TBL] [Abstract][Full Text] [Related]
11. The graph neural network model. Scarselli F; Gori M; Tsoi AC; Hagenbuchner M; Monfardini G IEEE Trans Neural Netw; 2009 Jan; 20(1):61-80. PubMed ID: 19068426 [TBL] [Abstract][Full Text] [Related]
12. [Dynamic paradigm in psychopathology: "chaos theory", from physics to psychiatry]. Pezard L; Nandrino JL Encephale; 2001; 27(3):260-8. PubMed ID: 11488256 [TBL] [Abstract][Full Text] [Related]
13. Aspects of randomness in neural graph structures. Rudolph-Lilith M; Muller LE Biol Cybern; 2014 Aug; 108(4):381-96. PubMed ID: 24824724 [TBL] [Abstract][Full Text] [Related]
14. The ultrametric backbone is the union of all minimum spanning forests. Rozum JC; Rocha LM J Phys Complex; 2024 Sep; 5(3):035009. PubMed ID: 39131403 [TBL] [Abstract][Full Text] [Related]
15. A minimum resource neural network framework for solving multiconstraint shortest path problems. Zhang J; Zhao X; He X IEEE Trans Neural Netw Learn Syst; 2014 Aug; 25(8):1566-82. PubMed ID: 25050952 [TBL] [Abstract][Full Text] [Related]
16. Estimation and marginalization using the Kikuchi approximation methods. Pakzad P; Anantharam V Neural Comput; 2005 Aug; 17(8):1836-73. PubMed ID: 15969920 [TBL] [Abstract][Full Text] [Related]
17. A high-order graph generating self-organizing structure. Rizzo R Int J Neural Syst; 2005 Oct; 15(5):349-55. PubMed ID: 16278939 [TBL] [Abstract][Full Text] [Related]
18. Random walks in weighted networks with a perfect trap: an application of Laplacian spectra. Lin Y; Zhang Z Phys Rev E Stat Nonlin Soft Matter Phys; 2013 Jun; 87(6):062140. PubMed ID: 23848660 [TBL] [Abstract][Full Text] [Related]