scientific article
From MaRDI portal
Publication:3863914
zbMath0427.05037MaRDI QIDQ3863914
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Computational complexity of reconstruction and isomorphism testing for designs and line graphs ⋮ Concerning the complexity of deciding isomorphism of block designs ⋮ Coined quantum walks lift the cospectrality of graphs and trees ⋮ Benchmark Graphs for Practical Graph Isomorphism ⋮ Efficient graph automorphism by vertex partitioning ⋮ Graph isomorphism problem