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

An optimal time algorithm for finding a maximum weight independent set in a tree

โœ Scribed by G. H. Chen; M. T. Kuo; J. P. Sheu

Publisher
Springer Netherlands
Year
1988
Tongue
English
Weight
147 KB
Volume
28
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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