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

Unsolvability of some algorithmic problems for straight-line programs

โœ Scribed by D. V. Shiryaev

Publisher
Springer US
Year
1989
Tongue
English
Weight
441 KB
Volume
25
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An algorithm for straight-line represent
An algorithm for straight-line representation of simple planar graphs
โœ Lin Woo ๐Ÿ“‚ Article ๐Ÿ“… 1969 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 841 KB

An algorithm is developed for drawing straight-line planar graphs which are isomorphic to a convex polyhedron and simple (i.e. a connected graph with no self-loops or multiple branches). The construction of such graphs is outlined in three stages. Stage 1 determines all the independent cycles of the