계층적 속성그래프 사이의 최적정합을 위한 분기∙한정 알고리즘A Branch and Bound Algorithm for Optimal Isomorphism between Hierarchical Attributed Graphs
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | 성동수 | ko |
| dc.contributor.author | 박규호 | ko |
| dc.date.accessioned | 2013-02-24T08:26:11Z | - |
| dc.date.available | 2013-02-24T08:26:11Z | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.issued | 1994-04 | - |
| dc.identifier.citation | 정보과학회논문지 : 데이타베이스, v.21, no.4, pp.694 - 705 | - |
| dc.identifier.issn | 1229-7739 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/55687 | - |
| dc.language | Korean | - |
| dc.publisher | 한국정보과학회 | - |
| dc.title | 계층적 속성그래프 사이의 최적정합을 위한 분기∙한정 알고리즘 | - |
| dc.title.alternative | A Branch and Bound Algorithm for Optimal Isomorphism between Hierarchical Attributed Graphs | - |
| dc.type | Article | - |
| dc.type.rims | ART | - |
| dc.citation.volume | 21 | - |
| dc.citation.issue | 4 | - |
| dc.citation.beginningpage | 694 | - |
| dc.citation.endingpage | 705 | - |
| dc.citation.publicationname | 정보과학회논문지 : 데이타베이스 | - |
| dc.contributor.localauthor | 박규호 | - |
| dc.contributor.nonIdAuthor | 성동수 | - |
- Appears in Collection
- EE-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.