Graph Optimal Monomorphism Algorithms
From MaRDI portal
Publication:3877736
DOI10.1109/TSMC.1980.4308468zbMath0437.05053MaRDI QIDQ3877736
David Ghahraman, Tung Au, Andrew K. C. Wong
Publication date: 1980
Published in: IEEE Transactions on Systems, Man, and Cybernetics (Search for Journal in Brave)
branch-and-bound algorithmlower boundsreduction algorithmcartesian graph productoptimal graph monomorphism problem
Graph theory (05C99) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items (2)
A long trip in the charming world of graphs for pattern recognition ⋮ Efficient graph automorphism by vertex partitioning
This page was built for publication: Graph Optimal Monomorphism Algorithms