LDR | | 01562nam u200445 4500 |
001 | | 000000483733 |
005 | | 20230213150650 |
008 | | 230117s2022 |||||||||||||||||c||eng d |
020 | |
▼a 9798841569442 |
035 | |
▼a (MiAaPQ)AAI29276513 |
040 | |
▼a MiAaPQ
▼c MiAaPQ
▼d 247004 |
082 | 0 |
▼a 500 |
100 | 1 |
▼a Belbasi, Mahdi. |
245 | 10 |
▼a Fpt Aglorithms for NP-Complete Graph Problems Parameterized by Treewidth and Tree-Depth. |
260 | |
▼a [S.l.]:
▼b The Pennsylvania State University.,
▼c 2022. |
260 | 1 |
▼a Ann Arbor:
▼b ProQuest Dissertations & Theses,
▼c 2022. |
300 | |
▼a 132 p. |
500 | |
▼a Source: Dissertations Abstracts International, Volume: 84-02, Section: B. |
500 | |
▼a Advisor: Furer, Martin. |
502 | 1 |
▼a Thesis (Ph.D.)--The Pennsylvania State University, 2022. |
506 | |
▼a This item must not be sold to any third party vendors. |
590 | |
▼a School code: 0176. |
650 | 4 |
▼a Decomposition. |
650 | 4 |
▼a Dynamic programming. |
650 | 4 |
▼a Algorithms. |
650 | 4 |
▼a Graphs. |
650 | 4 |
▼a Traveling salesman problem. |
650 | 4 |
▼a Computer science. |
650 | 4 |
▼a Operations research. |
690 | |
▼a 0984 |
690 | |
▼a 0796 |
710 | 20 |
▼a The Pennsylvania State University. |
773 | 0 |
▼t Dissertations Abstracts International
▼g 84-02B. |
773 | |
▼t Dissertation Abstract International |
790 | |
▼a 0176 |
791 | |
▼a Ph.D. |
792 | |
▼a 2022 |
793 | |
▼a English |
856 | 40 |
▼u http://www.riss.kr/pdu/ddodLink.do?id=T16618681
▼n KERIS
▼z 이 자료의 원문은 한국교육학술정보원에서 제공합니다. |
980 | |
▼a 202302
▼f 2023 |
990 | |
▼a ***1012033 |
991 | |
▼a E-BOOK |