Answers are grounded in this paper and cite their sources.
A new algorithm is presented for detecting graph monomorphisms for a pair of graphs. This algorithm entails a tree search based on the projections of the product graph called the net of the two graphs. It uses the minimum number of neighbors of the projected graphs to detect infeasible subtrees. The algorithm, in comparison with that of Deo and coworkers, is more efficient in its storage space utilization and average execution time. It does not suffer from the ambiguity which arises in Deo et al.'s work when cyclic graphs are matched. Applications to attributed graph monomorphisms are included.
No takes yet. Share an insight, caveat, or question.
Akinniyi et al. (1986) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: