Recognition algorithm for vertex-minorsVertex-minor를 찾는 알고리즘
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Oum, Sang-il | - |
| dc.contributor.advisor | 엄상일 | - |
| dc.contributor.author | Kang, Yeong-joon | - |
| dc.date.accessioned | 2019-09-03T02:44:51Z | - |
| dc.date.available | 2019-09-03T02:44:51Z | - |
| dc.date.issued | 2019 | - |
| dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=843279&flag=dissertation | en_US |
| dc.identifier.uri | http://hdl.handle.net/10203/266409 | - |
| dc.description | 학위논문(석사) - 한국과학기술원 : 수리과학과, 2019.2,[ii, 22 p. :] | - |
| dc.description.abstract | We show that for every fixed graph H with $l V(H) l \leqslant 6$, one can decide whether the input graph contains a vertex-minor isomorphic to H in polynomial time. To show this, we prove that for every graph H with $l V(H) l \leqslant 6$, graphs having no vertex-minor isomorphic to H have bounded rank-width, unless H is locally equivalent to the wheel graph on 6 vertices. | - |
| dc.language | eng | - |
| dc.publisher | 한국과학기술원 | - |
| dc.subject | Vertex-minor▼arank-width▼alocal complementation | - |
| dc.title | Recognition algorithm for vertex-minors | - |
| dc.title.alternative | Vertex-minor를 찾는 알고리즘 | - |
| dc.type | Thesis(Master) | - |
| dc.identifier.CNRN | 325007 | - |
| dc.description.department | 한국과학기술원 :수리과학과, | - |
| dc.contributor.alternativeauthor | 강영준 | - |
- 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.