• DocumentCode
    2175186
  • Title

    Graph connectivity in electrical studies

  • Author

    Gaol, F.L. ; Widjaja, B.

  • Author_Institution
    Fac. of Comput. Sci., Univ. of Indonesia, Depok
  • fYear
    2007
  • fDate
    20-22 Dec. 2007
  • Firstpage
    1047
  • Lastpage
    1052
  • 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
    graph theory; pattern clustering; statistical analysis; cluster analysis; electrical studies; graph connectivity; graph theoretic techniques; highly connected subgraphs; polynomial algorithm; similarity graph; Algorithms; Clustering; Graph connectivity; Minimum cut; diameter;
  • fLanguage
    English
  • Publisher
    iet
  • Conference_Titel
    Information and Communication Technology in Electrical Sciences (ICTES 2007), 2007. ICTES. IET-UK International Conference on
  • Conference_Location
    Tamil Nadu
  • ISSN
    0537-9989
  • Type

    conf

  • Filename
    4735948
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2175186