On the isomorphism testing of graphs
Graph Isomorphism is one of the very few classical problems in NP of unsettled complexity status. The families of highly regular structures, for example Steiner 2-designs, strongly regular graphs and primitive coherent configurations, have been perceived as difficult cases for graph isomorphism. The...
| Main Author: | |
|---|---|
| Language: | English |
| Published: |
2016
|
| Subjects: | |
| Online Access: | https://doi.org/10.7916/D8416X8N |