✦ LIBER ✦

The complexity of testing whether a graph is a superconcentrator

✍ Scribed by M. Blum; R.M. Karp; O. Vornberger; C.H. Papadimitriu; M. Yannakakis

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A polynomial algorithm for testing wheth

✍ Ortrud Oellermann; Jeremy P. Spinrad 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 553 KB

On the complexity of deciding whether th

✍ Elaine M. Eschen; Chính T. Hoàng; R. Sritharan; Lorna Stewart 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 195 KB

On the complexity of testing a graph for

✍ Kabekode V.S. Bhat 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 488 KB

A criterion for testing whether a differ

✍ Chunming Yuan; Xiao-Shan Gao 📂 Article 📅 2009 🏛 Academy of Mathematics and Systems Science, Chines 🌐 English ⚖ 237 KB

An Algorithm for Determining Whether the

✍ Even, Shimon 📂 Article 📅 1975 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 455 KB

On the problem of testing whether a mixe

✍ Bjørn Sundt 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 126 KB