HAO Zhongxiao. RESEARCH ON AN ALGORITHM TO FIND OPTIMAL COVER OF AN FDS SET BASED ON HYPERGRAPHJ. Journal of Computer Research and Development, 1996, 33(10).
Citation:
HAO Zhongxiao. RESEARCH ON AN ALGORITHM TO FIND OPTIMAL COVER OF AN FDS SET BASED ON HYPERGRAPHJ. Journal of Computer Research and Development, 1996, 33(10).
HAO Zhongxiao. RESEARCH ON AN ALGORITHM TO FIND OPTIMAL COVER OF AN FDS SET BASED ON HYPERGRAPHJ. Journal of Computer Research and Development, 1996, 33(10).
Citation:
HAO Zhongxiao. RESEARCH ON AN ALGORITHM TO FIND OPTIMAL COVER OF AN FDS SET BASED ON HYPERGRAPHJ. Journal of Computer Research and Development, 1996, 33(10).
RESEARCH ON AN ALGORITHM TO FIND OPTIMAL COVER OF AN FDS SET BASED ON HYPERGRAPH
In this paper, the structure trait of a hypergraph corresponding to an optimal cover is analyzed based on the hypergraph and its classes of cycles discussed in3, 4,and 5. A polynomial-time algorithm to find optimal cover by replacing a simplified method is given.
DownLoad: