A Parallel Improvement Algorithm for the Bipartite Subgraph Problem

Kuo Chun Lee; Nobuo Funabiki; Yoshiyasu Takefuji

doi:10.1109/72.105427

A Parallel Improvement Algorithm for the Bipartite Subgraph Problem

Kuo Chun Lee, Nobuo Funabiki, Yoshiyasu Takefuji

Research output: Contribution to journal › Article › peer-review

53 Citations (Scopus)

Abstract

Since McCulloch and Pitts proposed an artificial neuron model in 1943, several neuron models have been investigated. This paper proposes the first parallel improvement algorithm using the maximum neural network model for the bipartite subgraph problem. The goal of this NP-complete problem is to remove the minimum number of edges in a given graph such that the remaining graph is a bipartite graph. A large number of instances have been simulated to verify the proposed algorithm, with the simulation result showing that our algorithm finds a solution within 200 iteration steps and the solution quality is superior to that of the best existing algorithm. The algorithm is extended for the k-partite subgraph problem, where no algorithm has been proposed.

Original language	English
Pages (from-to)	139-145
Number of pages	7
Journal	IEEE Transactions on Neural Networks
Volume	3
Issue number	1
DOIs	https://doi.org/10.1109/72.105427
Publication status	Published - 1992 Jan
Externally published	Yes

ASJC Scopus subject areas

Software
Computer Science Applications
Computer Networks and Communications
Artificial Intelligence

Access to Document

10.1109/72.105427

Cite this

@article{cbd071f8ab52493093337a9cf9ae5674,

title = "A Parallel Improvement Algorithm for the Bipartite Subgraph Problem",

abstract = "Since McCulloch and Pitts proposed an artificial neuron model in 1943, several neuron models have been investigated. This paper proposes the first parallel improvement algorithm using the maximum neural network model for the bipartite subgraph problem. The goal of this NP-complete problem is to remove the minimum number of edges in a given graph such that the remaining graph is a bipartite graph. A large number of instances have been simulated to verify the proposed algorithm, with the simulation result showing that our algorithm finds a solution within 200 iteration steps and the solution quality is superior to that of the best existing algorithm. The algorithm is extended for the k-partite subgraph problem, where no algorithm has been proposed.",

author = "Lee, {Kuo Chun} and Nobuo Funabiki and Yoshiyasu Takefuji",

year = "1992",

month = jan,

doi = "10.1109/72.105427",

language = "English",

volume = "3",

pages = "139--145",

journal = "IEEE Transactions on Neural Networks and Learning Systems",

issn = "2162-237X",

publisher = "IEEE Computational Intelligence Society",

number = "1",

}

TY - JOUR

T1 - A Parallel Improvement Algorithm for the Bipartite Subgraph Problem

AU - Lee, Kuo Chun

AU - Funabiki, Nobuo

AU - Takefuji, Yoshiyasu

PY - 1992/1

Y1 - 1992/1

N2 - Since McCulloch and Pitts proposed an artificial neuron model in 1943, several neuron models have been investigated. This paper proposes the first parallel improvement algorithm using the maximum neural network model for the bipartite subgraph problem. The goal of this NP-complete problem is to remove the minimum number of edges in a given graph such that the remaining graph is a bipartite graph. A large number of instances have been simulated to verify the proposed algorithm, with the simulation result showing that our algorithm finds a solution within 200 iteration steps and the solution quality is superior to that of the best existing algorithm. The algorithm is extended for the k-partite subgraph problem, where no algorithm has been proposed.

AB - Since McCulloch and Pitts proposed an artificial neuron model in 1943, several neuron models have been investigated. This paper proposes the first parallel improvement algorithm using the maximum neural network model for the bipartite subgraph problem. The goal of this NP-complete problem is to remove the minimum number of edges in a given graph such that the remaining graph is a bipartite graph. A large number of instances have been simulated to verify the proposed algorithm, with the simulation result showing that our algorithm finds a solution within 200 iteration steps and the solution quality is superior to that of the best existing algorithm. The algorithm is extended for the k-partite subgraph problem, where no algorithm has been proposed.

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

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

U2 - 10.1109/72.105427

DO - 10.1109/72.105427

M3 - Article

AN - SCOPUS:0026628404

SN - 2162-237X

VL - 3

SP - 139

EP - 145

JO - IEEE Transactions on Neural Networks and Learning Systems

JF - IEEE Transactions on Neural Networks and Learning Systems

IS - 1

ER -

A Parallel Improvement Algorithm for the Bipartite Subgraph Problem

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this