✦ LIBER ✦

A faster algorithm for finding edge-disjoint branchings

✍ Scribed by Po Tong; E.L. Lawler

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A faster algorithm for finding edge-disj

✍ Po Tong; E.L. Lawler 📂 Article 📅 1983 🏛 Elsevier Science ⚖ 118 KB

A good algorithm for edge-disjoint branc

✍ Robert Endre Tarjan 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 368 KB

Finding Edge-disjoint Paths in Networks:

✍ Maria J. Blesa; Christian Blum 📂 Article 📅 2007 🏛 Springer Netherlands 🌐 English ⚖ 935 KB

A Faster Algorithm for Finding Minimum T

✍ Guillaume Blin, Romeo Rizzi, Stéphane Vialette 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 473 KB

A parallel algorithm for edge-coloring o

✍ Eliezer A. Albacea 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 475 KB

A genetic algorithm for the maximum edge

✍ Hsu, Chia-Chun; Cho, Hsun-Jung 📂 Article 📅 2015 🏛 Elsevier Science 🌐 English ⚖ 394 KB