Publications
Detailed Information
볼록 이분할 그래프에서 최대 매칭을 찾기 위한 개선된 Boolean 회로 : (A)New boolean circuit for a maximum matching in convex bipartite graph
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | 박근수 | - |
dc.contributor.author | 박은희 | - |
dc.date.accessioned | 2010-02-09 | - |
dc.date.available | 2010-02-09 | - |
dc.date.copyright | 2006. | - |
dc.date.issued | 2006 | - |
dc.identifier.uri | http://dcollection.snu.ac.kr:80/jsp/common/DcLoOrgPer.jsp?sItemId=000000049323 | kog |
dc.identifier.uri | https://hdl.handle.net/10371/52500 | - |
dc.description | 학위논문(석사) --서울대학교 대학원 :전기. 컴퓨터공학부,2006. | ko |
dc.format.extent | 24 장 | ko |
dc.language.iso | ko | ko |
dc.publisher | 서울대학교 대학원 | ko |
dc.subject | Boolean circuit | ko |
dc.subject | Boolean circuit | ko |
dc.subject | 볼록 이분할 그래프 | ko |
dc.subject | convex bipartite graph | ko |
dc.subject | 최대 매칭 | ko |
dc.subject | maximum matching | ko |
dc.subject | prefix computation | ko |
dc.subject | prefix computation | ko |
dc.subject | ASCEND | ko |
dc.subject | ASCEND | ko |
dc.subject | odd-even merge | ko |
dc.subject | odd-even merge | ko |
dc.title | 볼록 이분할 그래프에서 최대 매칭을 찾기 위한 개선된 Boolean 회로 | ko |
dc.title.alternative | (A)New boolean circuit for a maximum matching in convex bipartite graph | ko |
dc.type | Thesis | - |
dc.contributor.department | 전기. 컴퓨터공학부 | - |
dc.description.degree | Master | ko |
- Appears in Collections:
- Files in This Item:
- There are no files associated with this item.
Item View & Download Count
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.