PARTITIONING GRAPH MATCHING WITH CONSTRAINTS

Authors
BLAKE RE
Citation
Re. Blake, PARTITIONING GRAPH MATCHING WITH CONSTRAINTS, Pattern recognition, 27(3), 1994, pp. 439-446
Citations number
9
Categorie Soggetti
Computer Sciences, Special Topics","Engineering, Eletrical & Electronic","Computer Science Artificial Intelligence
Journal title
Pattern recognition → ACNP
ISSN journal
00313203
Volume
27
Issue
3
Year of publication
1994
Pages
439 - 446
Database
ISI
SICI code
0031-3203(1994)27:3<439:PGMWC>2.0.ZU;2-O
Abstract
The partitioning of the graph matching problem into sub-problems under the control of constraints is considered. Scott lattice theory is sug gested 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 illustra ted with an example.