✦ LIBER ✦

On the complexity of tree embedding problems

✍ Scribed by Shai Simonson; I.Hal Sudborough

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of the capacitated tree p

✍ C. H. Papadimitriou 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 707 KB

The decision-tree complexity of element

✍ Ravi B. Boppana 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 216 KB

Special Issue on the Complexity of Multi

✍ Fred J. Hickernell; Henryk Wożniakowski 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 41 KB

On the complexity of preemptive openshop

✍ C. Sriskandarajah; E. Wagneur 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 731 KB

Combinatorial theorems about embedding t

✍ Amit Chakrabarti; Subhash Khot 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB

The complexity of the node capacitated i

✍ Shinji Imahori; Yuichiro Miyamoto; Hideki Hashimoto; Yusuke Kobayashi; Mihiro Sa 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 234 KB