By Topic

Enumeration of Hamiltonian circuits in digraphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
V. V. B. Rao ; North Dakota State University, Fargo, ND, USA ; K. S. Rao

A simple procedure for the enumeration of Hamiltonian circuits of a directed graph is presented. The new method is based on an efficient technique of subset generation. The method can be easily implemented on a computer.

Published in:

Proceedings of the IEEE  (Volume:73 ,  Issue: 10 )