Choiceless Polynomial Time, Symmetric Circuits and Cai-Fürer-Immerman Graphs.
Benedikt PagoPublished in: CoRR (2021)
Keyphrases
- graph isomorphism
- satisfy the triangle inequality
- graph matching
- polynomial time complexity
- special case
- graph theory
- graph theoretic
- worst case
- bipartite graph
- graph mining
- web based learning
- bounded treewidth
- planar graphs
- high speed
- edge weights
- computer assisted instruction
- computational complexity
- approximation algorithms
- spanning tree
- tunnel diode
- neural network
- delay insensitive
- statistically significant
- subgraph isomorphism
- weighted graph
- circuit design
- graph structures
- computer assisted
- pattern mining
- structured data
- directed graph
- np complete
- np hard
- undirected graph