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

Algorithms for Singleton Attractor Detection in Planar and Nonplanar AND/OR Boolean Networks

โœ Scribed by Takeyuki Tamura; Tatsuya Akutsu


Publisher
Springer-Verlag
Year
2009
Tongue
English
Weight
627 KB
Volume
2
Category
Article
ISSN
1661-8270

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Faster exact algorithms for steiner tree
โœ Marshall Bern ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 739 KB

We improve the time and space complexities of dynamic programming algorithms that compute optimal Steiner trees spanning nodes in planar networks. Our algorithms have special application to the rectilinear Steiner problem.