The Hamiltonian Circuit Algorithm

Description

Please refer to the section
BELOW
(and
NOT ABOVE
) this line for the product details
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Title:
The Hamiltonian Circuit Algorithm
ISBN13:
9781466381377
ISBN10:
146638137X
Author:
Dharwadker, Ashay (Author)
Description:
We Present A New Polynomial-Time Algorithm For Finding Hamiltonian Circuits In Graphs It Is Shown That The Algorithm Always Finds A Hamiltonian Circuit In Graphs That Have At Least Three Vertices And Minimum Degree At Least Half The Total Number Of Vertices In The Process, We Also Obtain A Constructive Proof Of Dirac's Famous Theorem Of 1952, For The First Time The Algorithm Finds A Hamiltonian Circuit (Respectively, Tour) In All Known Examples Of Graphs That Have A Hamiltonian Circuit (Respectively, Tour) In View Of The Importance Of The P Versus Np Question, We Ask: Does There Exist A Graph That Has A Hamiltonian Circuit (Respectively, Tour) But For Which This Algorithm Cannot Find A Hamiltonian Circuit (Respectively, Tour)? The Algorithm Is Implemented In C++ And The Program Is Demonstrated With Several Examples
Binding:
Paperback, Paperback
Publisher:
CREATESPACE
Publication Date:
2011-10-02
Weight:
0.23 lbs
Dimensions:
0.09'' H x 11.02'' L x 8.5'' W
Number of Pages:
34
Language:
English