A graph-theoretic result for a model of neural computation

DOI10.1016/S0166-218X(97)00021-8MaRDI QIDQ1383384zbMATH OpenFDO

Authors A. V. Gerbessiotis

Publication date 1 November 1998

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL http://www.elsevier.com/locate/dam

zbMATH Keywords

connectivitygraph construction problemneural computationprojective plane graphreplication factorstrongly regular graphs

Mathematics Subject Classification ID

Connectivity (05C40) Structural characterization of families of graphs (05C75) Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30)

Recommendations

• Neural networks and graph theory
• scientific article; zbMATH DE number 140149
• scientific article; zbMATH DE number 4031742
• Neural network model of equitable coloring of graphs

Cites work

• A theory of the learnable
• scientific article; zbMATH DE number 3904630 (Why is no real title available?)
• scientific article; zbMATH DE number 3943824 (Why is no real title available?)
• scientific article; zbMATH DE number 826255 (Why is no real title available?)
• scientific article; zbMATH DE number 3232670 (Why is no real title available?)
• scientific article; zbMATH DE number 3421490 (Why is no real title available?)
• Polarities in finite projective planes
• Über ein Problem von K. Zarankiewicz

Cited in

(7)

• Connectionist networks qua graphs
• Hypergraph analysis of neural networks
• Topological model of neural information networks
• A stochastic population approach to the problem of stable recruitment hierarchies in spiking neural networks
• Experience-Induced Neural Circuits That Achieve High Capacity
• Random Graphs In A Neural Computation Model
• A graphical approach to a model of a neuronal tree with a variable diameter

This page was built for publication: A graph-theoretic result for a model of neural computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1383384)