Choiceless Polynomial Time, Counting and the Cai-Fürer-Immerman Graphs: (Extended Abstract).
Anuj DawarDavid RicherbyBenjamin RossmanPublished in: Electron. Notes Theor. Comput. Sci. (2006)
Keyphrases
- extended abstract
- graph isomorphism
- polynomial time complexity
- bounded treewidth
- graph matching
- special case
- np complete
- computer assisted instruction
- web based learning
- graph mining
- graph databases
- social networks
- planar graphs
- graph theoretic
- bipartite graph
- approximation algorithms
- worst case
- graph model
- subgraph isomorphism
- labeled graphs
- graph theory
- graph representation
- random graphs
- graph construction
- random walk
- computational complexity
- neural network