Finding the Maximal Independent Set in the Random Graph
Guo Ting-hua · Journal of Xinzhou Teachers University · 2010
This paper introduces that different types of random graph is generated by vertices and edge benchmark density valuation.Finding a maximum independent set by non-greedy algorithm is tested on random graph.The test results were analyzed.It conclues between vertices,edge density,edge benchmark density and teste-time,independence number.