Graph connectivity in electrical studies

Ford Lumban Gaol, Belawati H. Widjaja

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Graph connectivity become central theme in electrical studies. We proposed a novel algorithm for cluster analysis that is based on graph theoretic techniques. A similarity graph is defined and clusters in that graph correspond to highly connected subgraphs. A polynomial algorithm to compute them efficiently is presented. Our algorithm produces a solution with some provably good properties and performs well on synthetic data.

Original languageEnglish
Title of host publicationIET-UK International Conference on Information and Communication Technology in Electrical Sciences, ICTES 2007
Pages1047-1052
Number of pages6
Edition2
DOIs
Publication statusPublished - 1 Dec 2007
EventIET-UK International Conference on Information and Communication Technology in Electrical Sciences, ICTES 2007 - Tamil Nadu, India
Duration: 20 Dec 200722 Dec 2007

Publication series

NameIET Seminar Digest
Number2
Volume2007

Conference

ConferenceIET-UK International Conference on Information and Communication Technology in Electrical Sciences, ICTES 2007
CountryIndia
CityTamil Nadu
Period20/12/0722/12/07

Keywords

  • Algorithms
  • Clustering
  • Diameter
  • Graph connectivity
  • Minimum cut

Fingerprint Dive into the research topics of 'Graph connectivity in electrical studies'. Together they form a unique fingerprint.

Cite this