HAO Zhongxiao. RESEARCH ON ALGORITHMS TO FIND OUT MINIMUM COVER AND CLOSURE BASED ON MIXED HYPERGRAPHJ. Journal of Computer Research and Development, 1996, 33(10).
Citation:
HAO Zhongxiao. RESEARCH ON ALGORITHMS TO FIND OUT MINIMUM COVER AND CLOSURE BASED ON MIXED HYPERGRAPHJ. Journal of Computer Research and Development, 1996, 33(10).
HAO Zhongxiao. RESEARCH ON ALGORITHMS TO FIND OUT MINIMUM COVER AND CLOSURE BASED ON MIXED HYPERGRAPHJ. Journal of Computer Research and Development, 1996, 33(10).
Citation:
HAO Zhongxiao. RESEARCH ON ALGORITHMS TO FIND OUT MINIMUM COVER AND CLOSURE BASED ON MIXED HYPERGRAPHJ. Journal of Computer Research and Development, 1996, 33(10).
RESEARCH ON ALGORITHMS TO FIND OUT MINIMUM COVER AND CLOSURE BASED ON MIXED HYPERGRAPH
In this paper,some theorems relevant to eliminating redundancy based on a mixed hypergraph are discussed and the theory is improved.New algorithms to find out minimum cover and closure are given and the relevant algorithms are analyzed.
DownLoad: