✦ LIBER ✦

On the determination of all tie sets and minimal cut sets between any two nodes of a graph through Petri nets

✍ Scribed by G.S. Hura

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the determination of all tie sets and

📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 133 KB

Determination of all hamiltonian paths a

✍ G.S. Hura 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 331 KB

Determination of all minimal cut-sets be

📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 113 KB