๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A simple linear expected time algorithm for finding a hamilton path

โœ Scribed by Andrew Thomason

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
496 KB
Volume
75
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis

Discrete Mathematics 75 (1989) 373-379 North-Holland n?", so the problem is one of finding a fast algorithm which works on all graphs in %(n, p) except for a proportion somewhat smaller than 2~". This will be our algorithm A2. A very fast algorithm, which works on most graphs but not on as many as A2 does, is used to bring the running time down to O(n/p). This will be algorithm Al.

The algorithm A2 was originally based on a study of hamilton cycles in "concrete random graphs" in [12].

๐Ÿ“œ SIMILAR VOLUMES

A Linear Time Algorithm for Finding ak-T
A Linear Time Algorithm for Finding ak-Tree Core
โœ Akiyoshi Shioura; Takeaki Uno ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 173 KB

Given a tree containing n vertices, consider the sum of the distance between all ลฝ . vertices and a k-leaf subtree subtree which contains exactly k leaves . A k-tree core is a k-leaf subtree which minimizes the sum of the distances. In this paper, we propose a linear time algorithm for finding a k-t

A simple linear time algorithm for findi
A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone
โœ Glenn K. Manacher; Terrance A. Mankus ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 209 KB ๐Ÿ‘ 1 views

## Abstract We exhibit an algorithm for finding a maximum independent set (MIS) for __n__ presorted, unweighted circular arcs in time 0(__n__). Unlike previous algorithms, this is achieved by means of trivial postprocessing of the output of a straightforward algorithm for finding an MIS for a set o

A Simple Linear Time Algorithm for Trian
A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs
โœ H. Bodlaender; T. Kloks ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 560 KB

In this paper we consider the problem of determining whether a given colored graph can be triangulated, such that no edges between vertices of the same color are added. This problem originated from the perfect phylogeny problem from molecular biology and is strongly related with the problem of recog