Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs.
Anuj DawarDavid RicherbyBenjamin RossmanPublished in: Ann. Pure Appl. Log. (2008)
Keyphrases
- graph isomorphism
- bounded treewidth
- special case
- polynomial time complexity
- approximation algorithms
- planar graphs
- graph theoretic
- graph matching
- graph theory
- computational complexity
- directed graph
- worst case
- computer assisted instruction
- graph representation
- web based learning
- undirected graph
- weighted graph
- cooperative learning
- graph clustering
- graph construction
- graph search
- graph mining
- series parallel
- query language
- bipartite graph