✦ LIBER ✦

Enumeration of minimal paths of modified networks

✍ Scribed by J.M. Nahman

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 287 KB
Volume: 34
Category: Article
ISSN: 0026-2714
DOI: 10.1016/0026-2714(94)90086-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Exact enumeration of minimal paths of pa

Exact enumeration of minimal paths of partitioned networks

✍ J.M. Nahman 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 303 KB

Enumeration of minimal cuts of modified

Enumeration of minimal cuts of modified networks

✍ J.M. Nahman 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 170 KB

Enumeration of all simple paths in a com

Enumeration of all simple paths in a communication network

✍ R.B Misra; Krishna B Misra 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 310 KB

Enumeration of minimal cutsets from matr

Enumeration of minimal cutsets from matrix representation of directed/undirected networks

✍ S.K. Ghosh; Brijendra Singh 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 194 KB

Enumeration of networks

✍ P. F. Thomson 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 322 KB

The enumeration of minimal phylograms

✍ Ludwig Nastansky; Stanley M. Selkow; Neil F. Stewart 📂 Article 📅 1973 🏛 Springer 🌐 English ⚖ 381 KB

We consider the problem of finding a minimal tree to a set of nodes (of species represented by d characters) in a space of d-dimensions subject to the hypothesis that evolution is nonconvergent and irreversible. A solution to this problem is formulated, using integer linear programming techniques.