가야대학교 분성도서관
주메뉴
자료검색
- Home
- 상세정보
상세정보
부가기능
Some Problems in Graph Theory and Scheduling
상세 프로파일
| 자료유형 | E-Book |
|---|---|
| 개인저자 | Zhong, Mingxian. |
| 단체저자명 | Columbia University. Operations Research. |
| 서명/저자사항 | Some Problems in Graph Theory and Scheduling. |
| 발행사항 | [S.l.] : Columbia University., 2018 |
| 발행사항 | Ann Arbor : ProQuest Dissertations & Theses, 2018 |
| 형태사항 | 126 p. |
| 소장본 주기 | School code: 0054. |
| ISBN | 9780438350403 |
| 일반주기 |
Source: Dissertation Abstracts International, Volume: 80-02(E), Section: B.
Adviser: Clifford Stein. |
| 요약 | In this dissertation, we present three results related to combinatorial algorithms in graph theory and scheduling, both of which are important subjects in the area of discrete mathematics and theoretical computer science. In graph theory, a grap |
| 요약 | The first two results are related to coloring graphs belonging to specific classes. In scheduling problems, we are interested in how to efficiently schedule a set of jobs on machines. The last result is related to a scheduling problem in an envi |
| 요약 | A graph is H-free if it has no induced subgraph isomorphic to H. In the second part of this thesis, we characterize all graphs H for which there are only finitely many minimal non-three-colorable H-free graphs. This solves a problem posed by G |
| 요약 | The last result of this thesis deals with a scheduling problem addressing the uncertainty regarding the machines. We study a scheduling environment in which jobs first need to be grouped into some sets before the number of machines is known, and |
| 일반주제명 | Operations research. Computer science. Mathematics. |
| 언어 | 영어 |
| 기본자료 저록 | Dissertation Abstracts International80-02B(E). Dissertation Abstract International |
| 대출바로가기 | http://www.riss.kr/pdu/ddodLink.do?id=T15001035 |
소장정보
- 소장정보
인쇄
| No. | 등록번호 | 청구기호 | 소장처 | 도서상태 | 반납예정일 | 예약 | 서비스 | 매체정보 |
|---|---|---|---|---|---|---|---|---|
| 1 | WE00025940 | DP 658 | 가야대학교/전자책서버(컴퓨터서버)/ | 대출불가(별치) |
|
카피라이터
