Publications
Detailed Information
볼록 이분할 그래프에서 최대 매칭을 찾기 위한 개선된 Boolean 회로 : (A)New boolean circuit for a maximum matching in convex bipartite graph
Cited 0 time in
Web of Science
Cited 0 time in Scopus
- Authors
- Advisor
- 박근수
- Issue Date
- 2006
- Publisher
- 서울대학교 대학원
- Keywords
- Boolean circuit ; Boolean circuit ; 볼록 이분할 그래프 ; convex bipartite graph ; 최대 매칭 ; maximum matching ; prefix computation ; prefix computation ; ASCEND ; ASCEND ; odd-even merge ; odd-even merge
- Description
- 학위논문(석사) --서울대학교 대학원 :전기. 컴퓨터공학부,2006.
- Language
- Korean
- URI
- http://dcollection.snu.ac.kr:80/jsp/common/DcLoOrgPer.jsp?sItemId=000000049323
https://hdl.handle.net/10371/52500
- 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.