DocumentCode
1151416
Title
Graph Optimal Monomorphism Algorithms
Author
Ghahraman, David E. ; Wong, Andrew K.C. ; Au, Tung
Volume
10
Issue
4
fYear
1980
fDate
4/1/1980 12:00:00 AM
Firstpage
181
Lastpage
188
Abstract
The characterization of graph morphisms in terms of the subgraphs of the Cartesian graph product is extended and used to develop algorithms for an optimal graph monomorphism problem. The objective functional considered is defined as the sum of the weights associated with vertex and arc mappings. A reduction algorithm is proposed to obtain sharp lower bounds on the value of the solution. The lower bounds are used in a branch-and-bound algorithm for the optimal graph monomorphism problem.
Keywords
Concrete; Cost function; Councils; Gold; Image processing; Image retrieval; Information retrieval; Layout;
fLanguage
English
Journal_Title
Systems, Man and Cybernetics, IEEE Transactions on
Publisher
ieee
ISSN
0018-9472
Type
jour
DOI
10.1109/TSMC.1980.4308468
Filename
4308468
Link To Document