✦ LIBER ✦

Algorithms for calculating new parameters of network graphs

✍ Scribed by V. S. Mikhel'son

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New algorithms for calculating discrete

✍ A.M. Grigoryan 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 516 KB

An algorithm for outerplanar graphs with

✍ Binghuan Zhu; Wayne Goddard 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 328 KB

New Algorithms for Network Optimization

✍ Charalambous, C.; Bandler, J.W. 📂 Article 📅 1973 🏛 IEEE 🌐 English ⚖ 315 KB

Efficient algorithms for network localiz

✍ Li, Meng; Otachi, Yota; Tokuyama, Takeshi 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 537 KB

Comparison of algorithms calculating opt

✍ Th. Buzug; G. Pfister 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 692 KB

Calculating hansen solubility parameters

✍ Vebber, Guilherme Cañete; Pranke, Patricia; Pereira, Cláudio Nunes 📂 Article 📅 2013 🏛 John Wiley and Sons 🌐 English ⚖ 772 KB