Description: Please refer to the section BELOW (and NOT ABOVE) this line for the product details - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Title:The Vertex Coloring AlgorithmISBN13:9781466391321ISBN10:1466391324Author:Dharwadker, Ashay (Author)Description:We Present A New Polynomial-Time Algorithm For Finding Proper M-Colorings Of The Vertices Of A Graph We Prove That Every Graph With N Vertices And Maximum Vertex Degree Delta Must Have Chromatic Number Chi(G) Less Than Or Equal To Delta+1 And That The Algorithm Will Always Find A Proper M-Coloring Of The Vertices Of G With M Less Than Or Equal To Delta+1 Furthermore, We Prove That This Condition Is The Best Possible In Terms Of N And Delta By Explicitly Constructing Graphs For Which The Chromatic Number Is Exactly Delta+1 In The Special Case When G Is A Connected Simple Graph And Is Neither An Odd Cycle Nor A Complete Graph, We Show That The Algorithm Will Always Find A Proper M-Coloring Of The Vertices Of G With M Less Than Or Equal To Delta In The Process, We Obtain A New Constructive Proof Of Brooks' Famous Theorem Of 1941 For All Known Examples Of Graphs, The Algorithm Finds A Proper M-Coloring Of The Vertices Of The Graph G For M Equal To The Chromatic Number Chi(G) In View Of The Importance Of The P Versus Np Question, We Ask: Does There Exist A Graph G For Which This Algorithm Cannot Find A Proper M-Coloring Of The Vertices Of G With M Equal To The Chromatic Number Chi(G)? The Algorithm Is Demonstrated With Several Examples Of Famous Graphs, Including A Proper Four-Coloring Of The Map Of India And Two Large Mycielski Benchmark Graphs With Hidden Minimum Vertex Colorings 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.33 lbsDimensions:0.14'' H x 11.02'' L x 8.5'' WNumber of Pages:54Language:English
Price: 18.13 USD
Location: USA
End Time: 2024-05-22T03:04:49.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 Coloring Algorithm
Item Length: 11in.
Item Height: 0.1in.
Item Width: 8.5in.
Author: Ashay Dharwadker
Publication Name: Vertex Coloring Algorithm
Format: Trade Paperback
Language: English
Publisher: CreateSpace
Publication Year: 2011
Type: Textbook
Item Weight: 6.9 Oz
Number of Pages: 54 Pages
