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

An optimal visibility graph algorithm for triangulated simple polygons

โœ Scribed by John Hershberger


Publisher
Springer
Year
1989
Tongue
English
Weight
973 KB
Volume
4
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A Simple Linear Time Algorithm for Trian
โœ 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