### Abstract

A parallel algorithm based on a neural network model for solving clique vertex-partition problems in arbitrary non-directed graphs is presented in this paper. A clique of a graph G = (V, E) with a set of vertices V and a set of edges E is a complete subgraph of G where any pair of vertices is connected with an edge. A clique vertex-partition problem of a graph G is to partition every vertex in V into a set of disjointed cliques of G. The clique vertex-partition problem with the minimum number of cliques in an arbitrary graph is known to be NP-complete. The algorithm requires nm processing elements for the n vertex m partition problem. A total of 10 different problems with 8 vertex to 300 vertex graphs were examined where the algorithm found a solution in nearly constant time. The circuit diagram of the neural network model is also proposed in this paper.

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

Pages (from-to) | 357-372 |

Number of pages | 16 |

Journal | International Journal of Electronics |

Volume | 72 |

Issue number | 3 |

Publication status | Published - 1992 Mar |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Electrical and Electronic Engineering

### Cite this

*International Journal of Electronics*,

*72*(3), 357-372.

**Neural network parallel algorithm for clique vertex-partition problems.** / Funabiki, Nobuo; Takefuji, Yoshiyasu; Lee, Kuo Chun; Cho, Yong Beom.

Research output: Contribution to journal › Article

*International Journal of Electronics*, vol. 72, no. 3, pp. 357-372.

}

TY - JOUR

T1 - Neural network parallel algorithm for clique vertex-partition problems

AU - Funabiki, Nobuo

AU - Takefuji, Yoshiyasu

AU - Lee, Kuo Chun

AU - Cho, Yong Beom

PY - 1992/3

Y1 - 1992/3

N2 - A parallel algorithm based on a neural network model for solving clique vertex-partition problems in arbitrary non-directed graphs is presented in this paper. A clique of a graph G = (V, E) with a set of vertices V and a set of edges E is a complete subgraph of G where any pair of vertices is connected with an edge. A clique vertex-partition problem of a graph G is to partition every vertex in V into a set of disjointed cliques of G. The clique vertex-partition problem with the minimum number of cliques in an arbitrary graph is known to be NP-complete. The algorithm requires nm processing elements for the n vertex m partition problem. A total of 10 different problems with 8 vertex to 300 vertex graphs were examined where the algorithm found a solution in nearly constant time. The circuit diagram of the neural network model is also proposed in this paper.

AB - A parallel algorithm based on a neural network model for solving clique vertex-partition problems in arbitrary non-directed graphs is presented in this paper. A clique of a graph G = (V, E) with a set of vertices V and a set of edges E is a complete subgraph of G where any pair of vertices is connected with an edge. A clique vertex-partition problem of a graph G is to partition every vertex in V into a set of disjointed cliques of G. The clique vertex-partition problem with the minimum number of cliques in an arbitrary graph is known to be NP-complete. The algorithm requires nm processing elements for the n vertex m partition problem. A total of 10 different problems with 8 vertex to 300 vertex graphs were examined where the algorithm found a solution in nearly constant time. The circuit diagram of the neural network model is also proposed in this paper.

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

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

M3 - Article

AN - SCOPUS:0026835744

VL - 72

SP - 357

EP - 372

JO - International Journal of Electronics

JF - International Journal of Electronics

SN - 0020-7217

IS - 3

ER -