Hierarchical reduction and partition of hypergraph

Cited 6 time in webofscience Cited 0 time in scopus
  • Hit : 159
  • Download : 513
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.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
1996-04
Language
English
Article Type
Article
Keywords

PETRI

Citation

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, v.26, no.2, pp.340 - 344

ISSN
1083-4419
URI
http://hdl.handle.net/10203/18885
Appears in Collection
BiS-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 6 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0