Algorithm for solving bipartite subgraph problem with probabilistic self-organizing learning

Sze Tsan Choy, Wan Chi Siu

Research output: Journal article publicationConference articleAcademic researchpeer-review

2 Citations (Scopus)


Self-organizing model has been successfully applied to solve some combinatorial optimization problems, including travelling salesman problem, routing problem and cell-placement problem, but there has not much work reported on its application to solve graph partitioning problem. In this paper, we propose a novel mapping which has not been proposed before, with some changes to the original Kohonen's algorithm so as to enable it to solve a partitioning problem - the bipartite subgraph problem. This new approach is compared with the maximum neural network for solving the same problem, and shows that the performance of our new approach is superior over the maximum neural network.
Original languageEnglish
Pages (from-to)3351-3354
Number of pages4
JournalICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Publication statusPublished - 1 Jan 1995
EventProceedings of the 1995 20th International Conference on Acoustics, Speech, and Signal Processing. Part 2 (of 5) - Detroit, MI, United States
Duration: 9 May 199512 May 1995

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Electrical and Electronic Engineering


Dive into the research topics of 'Algorithm for solving bipartite subgraph problem with probabilistic self-organizing learning'. Together they form a unique fingerprint.

Cite this