Proceedings of the Korean Information Science Society Conference (한국정보과학회:학술대회논문집)

  • 2004.04a
  • /
  • Pages.952-954
  • /
  • 2004
  • /
  • 1598-5164(pISSN)
Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

A Boolean Circuit For Finding Maximum Matching In A Convex Bipartite Graph.

볼록 이분할 그래프에서 최대 매칭을 찾기 위한 불리안 회로

  • Lee, Sunghee (Dept. of Computer Eng, Hankuk Univ of Foreign Studies) ;
  • Yoojin Chung (Dept. of Computer Eng, Hankuk Univ of Foreign Studies)
  • Published : 2004.04.01
Download PDF
⟨ Previous Next ⟩

Abstract

We've developed a Boolean circuit that finds a maximum matching in a convex bipartite graph. This circuit is designed in BC language that was created by K. Park and H. Park(1). The depth of the circuit is O(log$^2$nㆍlog b) and the size is O(bn$^3$). Our circuit gets a triple representation of a convex bipartite graph as its input and produces the maximum matching for its output. We developed some Boolean circuit design techniques that can be used for building other Boolean circuits.

Keywords