A GRAPH CANONIZATION METHOD FOR PATTERN-RECOGNITION

被引：0
|
作者：
OWOLABI, O
机构：
来源：
PATTERN RECOGNITION LETTERS | 1991年 / 12卷 / 11期
关键词：
RELATIONAL STRUCTURE; GRAPH ISOMORPHISM; SIMILARITY MATCHING; CANONICAL REPRESENTATION; MATRIX MINIMIZATION;
D O I：
10.1016/0167-8655(91)90008-A
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
A relational graph matching technique based on the canonical orderings of the node of a graph is presented. The node ordering process is so constrained as to result in a method running in polynomial time. An example application to block world objects is given.
引用
收藏
页码：701 / 705
页数：5
相关论文
共 50 条
12345