|
|
|
Volumn , Issue , 1983, Pages 197-201
|
|
ALGORITHM FOR THE LARGEST COMMON SUBGRAPH ISOMORPHISM USING THE IMPLICIT NET.
a
a
NONE
|
|
Author keywords
[No Author keywords available]
|
|
Indexed keywords
BRANCH AND BOUND SEARCH;
GRAPHS PRODUCT PROJECTION;
LARGEST COMMON SUBGRAPH ISOMORPHISM;
NET SUBGRAPHS;
NONISOMORPHIC GRAPH PAIRS;
NONISOMORPHIC SUBGRAPHS;
BRANCH-AND-BOUND SEARCH;
IMPLICIT NET;
INCIDENCE RELATIONS BETWEEN TWO GRAPHS;
NONISOMORPHIC GRAPHS;
MATHEMATICAL TECHNIQUES;
COMPUTER PROGRAMMING - ALGORITHMS;
|
|
EID: 0020861117
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
|
Times cited : (9)
|
|
References (0)
|
