Characterizing graphs of maximum matching width at most 22 이하의 maximum matching width를 갖는 그래프에 대한 연구
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.
- Advisors
- Oum, Sang-ilresearcher; 엄상일researcher
- Description
- 한국과학기술원 :수리과학과,
- Publisher
- 한국과학기술원
- Issue Date
- 2016
- Identifier
- 325007
- Language
- eng
- Description
학위논문(석사) - 한국과학기술원 : 수리과학과, 2016.2 ,[iii, 20 p. :]
- Keywords
graph theory; maximum matching width; forbidden minor; branch-decomposition; width-parameter; 그래프이론; 마이너; 최대 매칭 위쓰; 브랜치-디컴포지션; 구조적 그래프이론
- 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.