Isomorphism of Graphs of Bounded Valence can be Tested in Polynomial Time.
Eugene M. LuksPublished in: J. Comput. Syst. Sci. (1982)
Keyphrases
- graph isomorphism
- bounded treewidth
- graph search
- graph theory
- subgraph isomorphism
- bounded degree
- graph mining
- special case
- np complete
- polynomial time complexity
- graph matching
- graph theoretic
- graph databases
- search algorithm
- graph data
- graph representation
- graph structure
- series parallel
- approximation algorithms
- shortest path
- computational complexity