AN ALGORITHM FOR OPTIMAL ISOMORPHISM BETWEEN 2 RANDOM GRAPHS

In this paper, we propose an algorithm to find the optimal isomorphism between two random graphs. The problem is formulated as a state-space search problem. The branch-and-bound algorithm using an efficient evaluation function is used to speed up the search. For this algorithm, we derive a consistent lower bounded estimate for an evaluation function from the entropy characteristics.
Publisher
ELSEVIER SCIENCE BV
Issue Date
1994-04
Language
ENG
Keywords

PATTERN-RECOGNITION

Citation

PATTERN RECOGNITION LETTERS, v.15, no.4, pp.321 - 327

ISSN
0167-8655
DOI
10.1016/0167-8655(94)90079-5
URI
http://hdl.handle.net/10203/57793
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
  • Hit : 149
  • Download : 0
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 3 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0