@inproceedings{69de0a5dbd3d47239039a0fd42c7b665,
title = "Graph connectivity in electrical studies",
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.",
keywords = "Algorithms, Clustering, Diameter, Graph connectivity, Minimum cut",
author = "Gaol, {Ford Lumban} and Widjaja, {Belawati H.}",
year = "2007",
doi = "10.1049/ic:20070764",
language = "English",
isbn = "9780863419379",
series = "IET Seminar Digest",
number = "2",
pages = "1047--1052",
booktitle = "IET-UK International Conference on Information and Communication Technology in Electrical Sciences, ICTES 2007",
edition = "2",
note = "IET-UK International Conference on Information and Communication Technology in Electrical Sciences, ICTES 2007 ; Conference date: 20-12-2007 Through 22-12-2007",
}