DocumentCode
763130
Title
Hierarchical reduction and partition of hypergraph
Author
Lee-Kwang, Hyung ; Cho, Choong Ho
Author_Institution
Dept. of Comput. Sci., Korea Adv. Inst. of Sci. & Technol., Seoul, South Korea
Volume
26
Issue
2
fYear
1996
fDate
4/1/1996 12:00:00 AM
Firstpage
340
Lastpage
344
Abstract
In this paper, a hierarchical reduction method of hypergraphs is proposed. A macro-vertex in a reduced hypergraph corresponds to an edge of the original hypergraph, and thus a reduced hypergraph can provide a partition of a system. The reduction is realized by the iterations and the sequence of hierarchical reduction gives a sequence of hierarchical partitions. The proposed method allows to reduce and decompose the complexity of the system represented by hypergraphs
Keywords
computational complexity; graph theory; hierarchical reduction; hypergraph partition; macro-vertex; Computer science; Engineering management; Large-scale systems; Systems engineering and theory;
fLanguage
English
Journal_Title
Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on
Publisher
ieee
ISSN
1083-4419
Type
jour
DOI
10.1109/3477.485886
Filename
485886
Link To Document