𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On finding hypercycles in chemical reaction networks

✍ Scribed by Can Özturan

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
322 KB
Volume
21
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On finding shortest paths in nonnegative
On finding shortest paths in nonnegative networks
✍ A. Rosenthal 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 438 KB

A modification of Dantzig's algorithm for the all! pairs shortest paths problem is given. The new algorithm applies only to graphs with nonnegative arc lengths. For an IV-node compkte graph ir has a worst case running time of fN3 triple operations of the form D-: = min(D--D-~+D~$ and iv" log N other

Information-processing capabilities of c
Information-processing capabilities of chemical reaction–diffusion systems. 2: Finding paths in a labyrinth based on reaction–diffusion media
✍ N. G. Rambidi; D. Yakovenchuk 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 350 KB 👁 3 views

A technique for finding the optimal path in a labyrinth based on wave processes in reaction-diffusion media is elaborated. Three principle points were assumed as a basis for this technique: (i) a hybrid architecture that combines an information-processing reaction-diffusion medium which performs ope