The Solving Algorithms And Their Applications For Hypergraph Path

With the developing of hypergraph theory, the research on the theory and its applications have been increasing. And in the fierce marketing competition environment, enterprises faced an important issue that how timely and effective discover market opportunities. So it is an important theoretical and practical significance that doing research on the supporting technical and system of Market Opportunities Discovery(MOD). First, a hypergraph path algorithm based on the relative theory of hypergraph and simple graph was explored in the thesis. according to hypergraph model , MOD's problem was transformed into a hypergraph path problem. Through the changing we provided theoretical and technical support for the research on MOD, and improved the hypergraph theory.Firstly, with the demonstratation of MOD's importance in market competitions, and the relative research about MOD and hypergraph researches and its applications recently , the frame of this thesis is clarified. Secondly, on the basis of Hypergraph sbipartite graph and relationship matrix,simple graph adjacency matrix and adjacency list etc hypergraph path related theory, it designs the solving algorithms and examples for two point hypergraph path, the threshold of the hypergraph path and the shortest hypergraph path. At last,on the foundation of the above-mentioned research, the hypergraph model of MOD is set up by the way of adopting the connection technique and obtaining a multifarious item to build up a hypergraph edge.According to the hypergraph model of MOD,the process of MOD was transformed into a hypergraph path problem. the service business as a example for the analytical frame,making use of the solving algorithm for two point hypergraph path,with the language righteousness of hypergraph path in the enterprise market opportunity discovery,describing the process of the MOD.