Equivalence of Free Boolean Graphs can be Decided Probabilistically in Polynomial Time.
Manuel BlumAshok K. ChandraMark N. WegmanPublished in: Inf. Process. Lett. (1980)
Keyphrases
- graph isomorphism
- polynomial time complexity
- bounded treewidth
- real valued
- special case
- truth table
- graph matching
- boolean functions
- graph theoretic
- np complete
- computational complexity
- approximation algorithms
- directed graph
- graph mining
- complex structures
- graph structure
- graph clustering
- graph search
- approximation ratio
- bipartite graph
- bounded degree
- learning algorithm