Neural network parallel algorithm for clique vertex-partition problems

Nobuo Funabiki, Yoshiyasu Takefuji, Kuo Chun Lee, Yong Beom Cho

Research output: Contribution to journalArticle

6 Citations (Scopus)

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 languageEnglish
Pages (from-to)357-372
Number of pages16
JournalInternational Journal of Electronics
Volume72
Issue number3
Publication statusPublished - 1992 Mar
Externally publishedYes

Fingerprint

Parallel algorithms
Neural networks
Networks (circuits)
Processing

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

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

In: International Journal of Electronics, Vol. 72, No. 3, 03.1992, p. 357-372.

Research output: Contribution to journalArticle

Funabiki, Nobuo ; Takefuji, Yoshiyasu ; Lee, Kuo Chun ; Cho, Yong Beom. / Neural network parallel algorithm for clique vertex-partition problems. In: International Journal of Electronics. 1992 ; Vol. 72, No. 3. pp. 357-372.
@article{21e36edb3c974820a1db5d803856b6e0,
title = "Neural network parallel algorithm for clique vertex-partition problems",
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.",
author = "Nobuo Funabiki and Yoshiyasu Takefuji and Lee, {Kuo Chun} and Cho, {Yong Beom}",
year = "1992",
month = "3",
language = "English",
volume = "72",
pages = "357--372",
journal = "International Journal of Electronics",
issn = "0020-7217",
publisher = "Taylor and Francis Ltd.",
number = "3",

}

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 -