• DocumentCode
    1197116
  • Title

    A new contribution to the cluster problem

  • Author

    Exposito, Antonio Gomez ; Franquelo, Leopoldo Garcia

  • Volume
    34
  • Issue
    5
  • fYear
    1987
  • fDate
    5/1/1987 12:00:00 AM
  • Firstpage
    546
  • Lastpage
    552
  • Abstract
    A heuristic algorithm for solving the cluster problem is presented in this paper. The algorithm exploits both the contour tableau and the newly developed path concept, and does not require the choice of a starting node. Experimental results show that the method is competitive with other published algorithms as far as border size is concerned. Furthermore, resultant fill-in is kept small.
  • Keywords
    Graph theory; Large-scale systems; Pattern clustering methods; Sparse matrices; Systems; Clustering algorithms; Heuristic algorithms; Large-scale systems; Power system analysis computing; Power system interconnection; Sparse matrices; Symmetric matrices; System testing; Systems engineering and theory;
  • fLanguage
    English
  • Journal_Title
    Circuits and Systems, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0098-4094
  • Type

    jour

  • DOI
    10.1109/TCS.1987.1086178
  • Filename
    1086178
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1197116