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

A linear time algorithm for minimum link paths inside a simple polygon

โœ Scribed by Subhash Suri


Publisher
Elsevier Science
Year
1986
Weight
827 KB
Volume
35
Category
Article
ISSN
0734-189X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A simple linear expected time algorithm
โœ Andrew Thomason ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 496 KB

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 A