Isomorphism, Automorphism Partitioning, and Canonical Labeling Can Be Solved in Polynomial-Time for Molecular Graphs.
Jean-Loup FaulonPublished in: J. Chem. Inf. Comput. Sci. (1998)
Keyphrases
- graph isomorphism
- subgraph isomorphism
- graph theory
- graph search
- graph partitioning
- graph mining
- graph data
- reachability queries
- conp complete
- graph databases
- graph matching
- image segmentation
- active learning
- spectral graph
- np complete
- polynomial time complexity
- approximation algorithms
- special case
- dna computing
- graph theoretic
- planar graphs
- bounded treewidth
- graph patterns
- label propagation
- labeling scheme
- graph representation
- weighted graph
- worst case
- three dimensional