✦ LIBER ✦

Computational complexity of computing a partial solution for the Graph Automorphism problems

✍ Scribed by Takayuki Nagoya; Seinosuke Toda

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Complexity of Modular Graph Automorp

✍ Arvind, V.; Beigel, R.; Lozano, A. 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 272 KB

Computational complexity of the graph ap

✍ A. A. Ageev; V. P. Il’ev; A. V. Kononov; A. S. Talevnin 📂 Article 📅 2007 🏛 Pleiades Publishing 🌐 English ⚖ 530 KB

The computational complexity of asymptot

✍ Kevin J. Compton 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 966 KB

The computational complexity of graph pr

✍ M. Karpinski; K. W. Wagner 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 451 KB

On planning the solution process for a p

✍ M. F. Kaspshitskaya; I. V. Sergienko 📂 Article 📅 1973 🏛 Springer US 🌐 English ⚖ 395 KB

Unique optimal solution instance and com

✍ He Jiang; XianChao Zhang; GuoLiang Chen 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 507 KB