Comment on "Isomorphism, Automorphism Partitioning, and Canonical Labeling Can Be Solved in Polynomial-Time for Molecular Graphs".
Bo Tao FanAnnick PanayeJean-Pierre DoucetPublished in: J. Chem. Inf. Comput. Sci. (1999)
Keyphrases
- graph isomorphism
- subgraph isomorphism
- graph theory
- graph search
- graph mining
- graph partitioning
- graph databases
- three dimensional
- image segmentation
- graph data
- spectral graph
- reachability queries
- polynomial time complexity
- worst case
- bounded treewidth
- approximation algorithms
- min sum
- dna computing
- planar graphs
- active learning
- np complete
- unsupervised learning
- graph matching
- computational complexity
- conp complete
- graph model
- news articles