✦ LIBER ✦

Constructing one-to-many disjoint paths in folded hypercubes

✍ Scribed by Cheng-Nan Lai; Gen-Huey Chen; Dyi-Rong Duh

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient construction of one-to-many

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

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

Many-to-many two-disjoint path covers in

✍ Kim, Sook-Yeon; Park, Jung-Heum 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 727 KB

Paired many-to-many disjoint path covers

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

One-to-many node-disjoint paths of hyper

✍ László Lipták; Eddie Cheng; Jong-Seok Kim; Sung Won Kim 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 308 KB