Science Central - All about Science

Saturday, 30 August, 2008

search

for
Directories
 
Category:  Science » Math » Combinatorics » Graph Theory UPDATE URL | REPORT BROKEN LINK

Hamiltonian Circuit Algorithm

Popularity:    Hit: 236 | Visit: 8
Details
A new algorithm for finding Hamiltonian circuits with a constructive proof of Dirac's theorem and applications to finding Knight's Tours by Ashay Dharwadker.

Sponsored Links:


URL:
Title: Hamiltonian Circuit Algorithm
Description:

A new algorithm for finding Hamiltonian circuits by Ashay Dharwadker. Copyright (C) 2004. All rights reserved.

Category: Cycle - Circuit - Algorithm - Hamiltonian - Ashay - Dharwadker


Related sites
Regular Graphs Page (Popularity: ): Tables of simple connected k-regular graphs on n vertices and girth at least g.
The Four Color Theorem (Popularity: ): Computer aided proof of the four color theorem by Neil Robertson, Daniel P. Sanders, Paul ...
Sandpiles in Graphs (Popularity: ): An application of cellular automata by Angela R. Kerns.
Network Resources for Colouring a Graph (Popularity: ): Resources for formulating and solving coloring problems.
Signed, Gain and Biased Graphs (Popularity: ): List of publications and manuscripts annotated by Thomas Zaslavsky.
Multicommodity Problems (Popularity: ): Instances and random generators of multicommodity flow and network design problems.
Graphnet Archives (Popularity: ): Archives of the Graphnet mailing list from February 1990.
Other Graph Theory and Related Pages (Popularity: ): Miscellaneous pages collected by Stephen C. Locke.
Four Colour Theorem (Popularity: ): A new proof of the four color theorem by Ashay Dharwadker that uses group theory ...
The Hamiltonian Page (Popularity: ): Hamiltonian cycle and path problems, their generalisations and variations.

© 2005-2008 Science Central. All Rights Reserved