Systematic searches for hypohamiltonian graphs
β Scribed by J. B. Collier; E. F. Schmeichel
- Publisher
- John Wiley and Sons
- Year
- 1978
- Tongue
- English
- Weight
- 413 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum-weighted subgraph spanning a given subset of nodes (terminals) of the original graph. In this paper, we describe a tabu search algorithm for the Steiner problem in graphs, based o
We describe a new search algorithm for speech recognition which applies the monotone graph search procedure to the problem of building a word graph. A first backward pass provides a method for estimating the word boundary times and phone segment boundary times needed to build the word graph using ei
A new and efficient method for overcoming the multiple minima ## Ε½ . problem of polypeptides, the systematic stepsize variation SSV method, is presented. The SSV is based on the assumption that energy barriers can be passed over by sufficiently large rotations about rotatable bonds: randomly Ε½ cho