✦ LIBER ✦

Optimal path in random networks with disorder: A mini review

✍ Scribed by Shlomo Havlin; Lidia A. Braunstein; Sergey V. Buldyrev; Reuven Cohen; Tomer Kalisky; Sameet Sreenivasan; H. Eugene Stanley

Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 244 KB
Volume: 346
Category: Article
ISSN: 0378-4371
DOI: 10.1016/j.physa.2004.08.053

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Length of optimal path in random network

Length of optimal path in random networks with strong disorder

✍ Sergey V. Buldyrev; Lidia A. Braunstein; Reuven Cohen; Shlomo Havlin; H.Eugene S 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 237 KB

Ranked solutions to a class of combinato

Ranked solutions to a class of combinatorial optimizations—with applications in mass spectrometry based peptide sequencing and a variant of directed paths in random media

✍ Timothy P. Doerr; Gelio Alves; Yi-Kuo Yu 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 400 KB

Typical combinatorial optimizations are NP-hard; however, for a particular class of cost functions the corresponding combinatorial optimizations can be solved in polynomial time using the transfer matrix technique or, equivalently, the dynamic programming approach. This suggests a way to efficiently