CaltechAUTHORS
  A Caltech Library Service

Recurrence-based Heuristics for the Hamiltonian Path Inclusion and Exclusion and Exclusion Algorithm

Bax, Eric (1994) Recurrence-based Heuristics for the Hamiltonian Path Inclusion and Exclusion and Exclusion Algorithm. Computer Science Technical Reports, California Institute of Technology , Pasadena, CA. (Unpublished) http://resolver.caltech.edu/CaltechCSTR:1994.cs-tr-94-11

[img]
Preview
Postscript - Submitted Version
See Usage Policy.

179Kb
[img]
Preview
PDF (Adobe PDF (188KB)) - Submitted Version
See Usage Policy.

183Kb

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechCSTR:1994.cs-tr-94-11

Abstract

For many problem instances, the inclusion and exclusion formula has many cancellations and symmetries. By imposing a hierarchy on the formula's terms, we develop general reductions for inclusion and exclusion algorithms. We apply these reductions to an algorithm which counts Hamiltonian paths, and we develop a branch and bound algorithm to detect Hamiltonian paths. Then we show how to apply the reductions to other inclusion and exclusion algorithms.


Item Type:Report or Paper (Technical Report)
Additional Information:© 1994 California Institute of Technology. Supported by and NSF Fellowship.
Group:Computer Science Technical Reports
Funders:
Funding AgencyGrant Number
NSF FellowshipUNSPECIFIED
Subject Keywords:algorithms, combinatorial problems, parallel algorithms
Classification Code:AMS subject classifications 05,68
DOI:10.7907/Z9CC0XQ0
Record Number:CaltechCSTR:1994.cs-tr-94-11
Persistent URL:http://resolver.caltech.edu/CaltechCSTR:1994.cs-tr-94-11
Usage Policy:You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.
ID Code:26790
Collection:CaltechCSTR
Deposited By: Imported from CaltechCSTR
Deposited On:25 Apr 2001
Last Modified:23 May 2017 14:07

Repository Staff Only: item control page