DocumentCode :
1178483
Title :
An efficient heuristic cluster algorithm for tearing large-scale networks
Author :
Sangiovanni-Vincentelli, Alberto ; Chen, Li-Kuan ; Chua, Leon O.
Volume :
24
Issue :
12
fYear :
1977
fDate :
12/1/1977 12:00:00 AM
Firstpage :
709
Lastpage :
717
Abstract :
An efficient heuristic algorithm for solving a cluster problem associated with the tearing of an undirected graph is presented via the concept of a contour tableau. The required computation time is shown to be bounded by 
, where 
and 
are the number of nodes and branches of the input graph, respectively. Experimental results show that our algorithm is highly efficient and yields near optimal solutions.
, where and are the number of nodes and branches of the input graph, respectively. Experimental results show that our algorithm is highly efficient and yields near optimal solutions.Keywords :
Graph theory; Interconnected networks; Large-scale networks and systems; Circuit theory; Clustering algorithms; Diakoptics; Heuristic algorithms; Integrated circuit interconnections; Large-scale systems; Linear programming; Operations research; Partitioning algorithms; Symmetric matrices;
fLanguage :
English
Journal_Title :
Circuits and Systems, IEEE Transactions on
Publisher :
ieee
ISSN :
0098-4094
Type :
jour
DOI :
10.1109/TCS.1977.1084298
Filename :
1084298
Link To Document :
