DC Field | Value | Language |
---|---|---|
dc.contributor.author | SEONG, DS | ko |
dc.contributor.author | CHOI, YK | ko |
dc.contributor.author | KIM, HS | ko |
dc.contributor.author | Park, Kyu Ho | ko |
dc.date.accessioned | 2013-02-24T14:19:12Z | - |
dc.date.available | 2013-02-24T14:19:12Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1994-04 | - |
dc.identifier.citation | PATTERN RECOGNITION LETTERS, v.15, no.4, pp.321 - 327 | - |
dc.identifier.issn | 0167-8655 | - |
dc.identifier.uri | http://hdl.handle.net/10203/57793 | - |
dc.description.abstract | 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. | - |
dc.language | English | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.subject | PATTERN-RECOGNITION | - |
dc.title | AN ALGORITHM FOR OPTIMAL ISOMORPHISM BETWEEN 2 RANDOM GRAPHS | - |
dc.type | Article | - |
dc.identifier.wosid | A1994NE91900001 | - |
dc.type.rims | ART | - |
dc.citation.volume | 15 | - |
dc.citation.issue | 4 | - |
dc.citation.beginningpage | 321 | - |
dc.citation.endingpage | 327 | - |
dc.citation.publicationname | PATTERN RECOGNITION LETTERS | - |
dc.identifier.doi | 10.1016/0167-8655(94)90079-5 | - |
dc.contributor.localauthor | Park, Kyu Ho | - |
dc.contributor.nonIdAuthor | SEONG, DS | - |
dc.contributor.nonIdAuthor | CHOI, YK | - |
dc.contributor.nonIdAuthor | KIM, HS | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | GRAPH ISOMORPHISM | - |
dc.subject.keywordAuthor | RANDOM GRAPH | - |
dc.subject.keywordAuthor | ENTROPY | - |
dc.subject.keywordPlus | PATTERN-RECOGNITION | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.