### Abstract

Hopfield neural network model for finding the shortest path between two nodes in a graph was proposed recently in some literatures. In this paper, we present a modified version of Hopfield model to a more general problem of searching an optimal tree (least total cost tree) from a source node to a number of destination nodes in a graph. This problem is called Steiner tree in graph theory, where it is proved to be a NP-complete. Through computer simulations, it is shown that the proposed model could always find an optimal or near-optimal valid solution in various graphs.

Original language | English |
---|---|

Pages (from-to) | 139-149 |

Number of pages | 11 |

Journal | Neural Processing Letters |

Volume | 3 |

Issue number | 3 |

Publication status | Published - 1996 |

### Fingerprint

### Keywords

- Hopfield model
- Neural networks
- Optimization
- Steiner tree

### ASJC Scopus subject areas

- Artificial Intelligence
- Neuroscience(all)

### Cite this

*Neural Processing Letters*,

*3*(3), 139-149.

**Neural network for optimal steiner tree computation.** / Pornavalai, Chotipat; Shiratori, Norio; Chakraborty, Goutam.

Research output: Contribution to journal › Article

*Neural Processing Letters*, vol. 3, no. 3, pp. 139-149.

}

TY - JOUR

T1 - Neural network for optimal steiner tree computation

AU - Pornavalai, Chotipat

AU - Shiratori, Norio

AU - Chakraborty, Goutam

PY - 1996

Y1 - 1996

N2 - Hopfield neural network model for finding the shortest path between two nodes in a graph was proposed recently in some literatures. In this paper, we present a modified version of Hopfield model to a more general problem of searching an optimal tree (least total cost tree) from a source node to a number of destination nodes in a graph. This problem is called Steiner tree in graph theory, where it is proved to be a NP-complete. Through computer simulations, it is shown that the proposed model could always find an optimal or near-optimal valid solution in various graphs.

AB - Hopfield neural network model for finding the shortest path between two nodes in a graph was proposed recently in some literatures. In this paper, we present a modified version of Hopfield model to a more general problem of searching an optimal tree (least total cost tree) from a source node to a number of destination nodes in a graph. This problem is called Steiner tree in graph theory, where it is proved to be a NP-complete. Through computer simulations, it is shown that the proposed model could always find an optimal or near-optimal valid solution in various graphs.

KW - Hopfield model

KW - Neural networks

KW - Optimization

KW - Steiner tree

UR - http://www.scopus.com/inward/record.url?scp=0030206324&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030206324&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0030206324

VL - 3

SP - 139

EP - 149

JO - Neural Processing Letters

JF - Neural Processing Letters

SN - 1370-4621

IS - 3

ER -