Description: Please refer to the section BELOW (and NOT ABOVE) this line for the product details - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Title:The Vertex Cover Algorithm (RePrint)ISBN13:9781466384477ISBN10:1466384476Author:Dharwadker, Ashay (Author)Description:We Present A New Polynomial-Time Algorithm For Finding Minimal Vertex Covers In Graphs The Algorithm Finds A Minimum Vertex Cover 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 Minimum Vertex Cover The Algorithm Is Demonstrated By Finding Minimum Vertex Covers For Several Famous Graphs, Including Two Large Benchmark Graphs With Hidden Minimum Vertex Covers 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.02'' L x 8.5'' WNumber of Pages:46Language:English
Price: 16.42 USD
Location: USA
End Time: 2024-09-22T05:01:38.000Z
Shipping Cost: 0 USD
Product Images
Item Specifics
Return shipping will be paid by: Buyer
All returns accepted: Returns Accepted
Item must be returned within: 30 Days
Refund will be given as: Money Back
Return policy details:
Book Title: The Vertex Cover Algorithm
Number of Pages: 44 Pages
Publication Name: Vertex Cover Algorithm
Language: English
Publisher: CreateSpace
Item Height: 0.1 in
Publication Year: 2011
Subject: Programming / Algorithms, Computer Science, Graphic Methods
Item Weight: 5.9 Oz
Type: Textbook
Item Length: 11 in
Subject Area: Mathematics, Computers
Author: Ashay Dharwadker
Item Width: 8.5 in
Format: Trade Paperback
