A Theoretical Investigation Based on the Rough Approximations of Hypergraphs

Algorithm 1

Method to compute PFD of a rough hypergraph.

(1)	Given a connected rough hypergraph
(2)	Compute the L2-section of
(3)	Using the Algorithm of Imrich and Peterin [52], decompose the labeled graphs and into prime factors w.r.t the Cartesian product. That is, the edges of and are colored w.r.t the copies of corresponding prime factors.
(4)	Merge the factors if necessary
(5)	Compute using the labeled and the PFD of is obtained such that the colored copies are the prime factors