On the number of edges of a fan-crossing free graph팬 교차가 없는 그래프에서의 엣지의 수의 범위
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Cheong, Otfried | - |
| dc.contributor.advisor | 정지원 | - |
| dc.contributor.author | Kim, Heun-A | - |
| dc.contributor.author | 김현아 | - |
| dc.date.accessioned | 2013-09-12T01:48:58Z | - |
| dc.date.available | 2013-09-12T01:48:58Z | - |
| dc.date.issued | 2013 | - |
| dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=515122&flag=dissertation | - |
| dc.identifier.uri | http://hdl.handle.net/10203/180447 | - |
| dc.description | 학위논문(석사) - 한국과학기술원 : 전산학과, 2013.2, [ iii, 21 p. ] | - |
| dc.description.abstract | A graph drawn in the plane with n vertices is fan-crossing free if there is no triple of edges e; f and g, such that e and f have a common endpoint and g crosses both e and f. We prove a tight bound of 4n < 9 on the maximum number of edges of such a graph for a straight-edge drawing. The bound is 4n < 8 if the edges are Jordan curves. We discuss generalizations to radial (k,1)-grid free graphs and monotone graph properties. | eng |
| dc.language | eng | - |
| dc.publisher | 한국과학기술원 | - |
| dc.subject | Graph Drawing | - |
| dc.subject | 그래프 이론 | - |
| dc.subject | 조합론 | - |
| dc.subject | Combinatorics | - |
| dc.title | On the number of edges of a fan-crossing free graph | - |
| dc.title.alternative | 팬 교차가 없는 그래프에서의 엣지의 수의 범위 | - |
| dc.type | Thesis(Master) | - |
| dc.identifier.CNRN | 515122/325007 | - |
| dc.description.department | 한국과학기술원 : 전산학과, | - |
| dc.identifier.uid | 020113179 | - |
| dc.contributor.localauthor | Cheong, Otfried | - |
| dc.contributor.localauthor | 정지원 | - |
- Appears in Collection
- CS-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.