scientific article; zbMATH DE number 910921
From MaRDI portal
Publication:4886098
zbMath0858.05074MaRDI QIDQ4886098
Publication date: 23 March 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
projectionspolynomial algorithmisomorphismcoloringscellular algebrascoherent configurationsisomorphism testingbounded eigenvalue multiplicity
Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (5)
On the Combinatorial Power of the Weisfeiler-Lehman Algorithm ⋮ Computational complexity of reconstruction and isomorphism testing for designs and line graphs ⋮ On the isomorphism of graphs having some eigenvalues of moderate multiplicity ⋮ Neighborhood hypergraphs of bipartite graphs ⋮ On the power of combinatorial and spectral invariants
This page was built for publication:
