상세정보
Export to Refworks부가기능
Fpt Aglorithms for NP-Complete Graph Problems Parameterized by Treewidth and Tree-Depth
상세 프로파일
| 자료유형 | 학위논문 |
|---|---|
| 서명/저자사항 | Fpt Aglorithms for NP-Complete Graph Problems Parameterized by Treewidth and Tree-Depth. |
| 개인저자 | Belbasi, Mahdi. |
| 단체저자명 | The Pennsylvania State University. |
| 발행사항 | [S.l.]: The Pennsylvania State University., 2022. |
| 발행사항 | Ann Arbor: ProQuest Dissertations & Theses, 2022. |
| 형태사항 | 132 p. |
| 기본자료 저록 | Dissertations Abstracts International 84-02B. Dissertation Abstract International |
| ISBN | 9798841569442 |
| 학위논문주기 | Thesis (Ph.D.)--The Pennsylvania State University, 2022. |
| 일반주기 |
Source: Dissertations Abstracts International, Volume: 84-02, Section: B.
Advisor: Furer, Martin. |
| 이용제한사항 | This item must not be sold to any third party vendors. |
| 일반주제명 | Decomposition. Dynamic programming. Algorithms. Graphs. Traveling salesman problem. Computer science. Operations research. |
| 언어 | 영어 |
| 바로가기 | 
: 이 자료의 원문은 한국교육학술정보원에서 제공합니다. |
