Characterizing graphs of maximum matching width at most 22 이하의 maximum matching width를 갖는 그래프에 대한 연구
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Oum, Sang-il | - |
| dc.contributor.advisor | 엄상일 | - |
| dc.contributor.author | Suh, Geewon | - |
| dc.contributor.author | 서기원 | - |
| dc.date.accessioned | 2017-03-29T02:34:51Z | - |
| dc.date.available | 2017-03-29T02:34:51Z | - |
| dc.date.issued | 2016 | - |
| dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=649510&flag=dissertation | en_US |
| dc.identifier.uri | http://hdl.handle.net/10203/221544 | - |
| dc.description | 학위논문(석사) - 한국과학기술원 : 수리과학과, 2016.2 ,[iii, 20 p. :] | - |
| dc.description.abstract | The maximum matching width is a width-parameter that is defined by a branch-decomposition over the vertex set of a graph using the symmetric submodular cut-function obtained by taking the size of a maximum matching of the bipartite graph crossing the cut. In this paper, we characterize the graphs of maximum matching width at most 2 using the minor obstruction set. Also, we find the exact value of the maximum matching width of a grid. | - |
| dc.language | eng | - |
| dc.publisher | 한국과학기술원 | - |
| dc.subject | graph theory | - |
| dc.subject | maximum matching width | - |
| dc.subject | forbidden minor | - |
| dc.subject | branch-decomposition | - |
| dc.subject | width-parameter | - |
| dc.subject | 그래프이론 | - |
| dc.subject | 마이너 | - |
| dc.subject | 최대 매칭 위쓰 | - |
| dc.subject | 브랜치-디컴포지션 | - |
| dc.subject | 구조적 그래프이론 | - |
| dc.title | Characterizing graphs of maximum matching width at most 2 | - |
| dc.title.alternative | 2 이하의 maximum matching width를 갖는 그래프에 대한 연구 | - |
| dc.type | Thesis(Master) | - |
| dc.identifier.CNRN | 325007 | - |
| dc.description.department | 한국과학기술원 :수리과학과, | - |
- Appears in Collection
- MA-Theses_Master(석사논문)
- 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.