✦ LIBER ✦

Many-to-many two-disjoint path covers in restricted hypercube-like graphs

✍ Scribed by Kim, Sook-Yeon; Park, Jung-Heum

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Paired many-to-many disjoint path covers

✍ Jo, Shinhaeng; Park, Jung-Heum; Chwa, Kyung-Yong 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 723 KB

Paired many-to-many disjoint path covers

✍ Chen, Xie-Bin 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 203 KB

Paired many-to-many disjoint path covers

✍ Xie-Bin Chen 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 180 KB

Many-to-many disjoint path covers in k-a

✍ Zhang, Shurong; Wang, Shiying 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 540 KB

Constructing one-to-many disjoint paths

✍ Cheng-Nan Lai; Gen-Huey Chen; Dyi-Rong Duh 📂 Article 📅 2002 🏛 IEEE 🌐 English ⚖ 418 KB

An efficient construction of one-to-many

✍ Lai, Cheng-Nan 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 519 KB