Partitioning graph matching with constraints

摘要

The partitioning of the graph matching problem into sub-problems under the control of constraints is considered. Scott lattice theory is suggested as a basis and the essential requirements on the data types and algorithms are stated. An example lattice of constraints is shown and a matching algorithm that partitions the matching problem is illustrated with an example.