The Independent Set Algorithm (RePrint)

Description: Please refer to the section BELOW (and NOT ABOVE) this line for the product details - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Title:The Independent Set Algorithm (RePrint)ISBN13:9781466387690ISBN10:1466387696Author:Dharwadker, Ashay (Author)Description:We Present A New Polynomial-Time Algorithm For Finding Maximal Independent Sets In Graphs As A Corollary, We Obtain New Bounds On The Famous Ramsey Numbers In Terms Of The Maximum And Minimum Vertex Degrees Of The Corresponding Ramsey Graphs The Algorithm Finds A Maximum Independent Set In All Known Examples Of Graphs In View Of The Importance Of The P Versus Np Question, We Ask If There Exists A Graph For Which The Algorithm Cannot Find A Maximum Independent Set The Algorithm Is Demonstrated By Finding Maximum Independent Sets For Several Famous Graphs, Including Two Large Benchmark Graphs With Hidden Maximum Independent Sets We Implement The Algorithm In C++ And Provide A Demonstration Program For Microsoft Windows Binding:Paperback, PaperbackPublisher:Createspace Independent Publishing PlatformPublication Date:2011-10-02Weight:0.29 lbsDimensions:0.12'' H x 11'' L x 8.5'' WNumber of Pages:46Language:English

Price: 16.42 USD

Location: USA

End Time: 2024-09-21T09:57:56.000Z

Shipping Cost: 0 USD