서브메뉴
검색
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.
상세정보
- 자료유형
- 학위논문
- Control Number
- 0016618681
- International Standard Book Number
- 9798841569442
- Dewey Decimal Classification Number
- 500
- Main Entry-Personal Name
- Belbasi, Mahdi.
- Publication, Distribution, etc. (Imprint
- [S.l.] : The Pennsylvania State University., 2022
- Publication, Distribution, etc. (Imprint
- Ann Arbor : ProQuest Dissertations & Theses, 2022
- Physical Description
- 132 p.
- General Note
- Source: Dissertations Abstracts International, Volume: 84-02, Section: B.
- General Note
- Advisor: Furer, Martin.
- Dissertation Note
- Thesis (Ph.D.)--The Pennsylvania State University, 2022.
- Restrictions on Access Note
- This item must not be sold to any third party vendors.
- Subject Added Entry-Topical Term
- Decomposition.
- Subject Added Entry-Topical Term
- Dynamic programming.
- Subject Added Entry-Topical Term
- Algorithms.
- Subject Added Entry-Topical Term
- Graphs.
- Subject Added Entry-Topical Term
- Traveling salesman problem.
- Subject Added Entry-Topical Term
- Computer science.
- Subject Added Entry-Topical Term
- Operations research.
- Added Entry-Corporate Name
- The Pennsylvania State University.
- Host Item Entry
- Dissertations Abstracts International. 84-02B.
- Host Item Entry
- Dissertation Abstract International
- Electronic Location and Access
- 로그인을 한후 보실 수 있는 자료입니다.
- Control Number
- joongbu:624675
MARC
008230216s2022 ulk 00 kor■001000016618681
■00520230206105558
■020 ▼a9798841569442
■035 ▼a(MiAaPQ)AAI29276513
■040 ▼aMiAaPQ▼cMiAaPQ
■0820 ▼a500
■1001 ▼aBelbasi, Mahdi.
■24510▼aFpt Aglorithms for NP-Complete Graph Problems Parameterized by Treewidth and Tree-Depth.
■260 ▼a[S.l.]▼bThe Pennsylvania State University. ▼c2022
■260 1▼aAnn Arbor▼bProQuest Dissertations & Theses▼c2022
■300 ▼a132 p.
■500 ▼aSource: Dissertations Abstracts International, Volume: 84-02, Section: B.
■500 ▼aAdvisor: Furer, Martin.
■5021 ▼aThesis (Ph.D.)--The Pennsylvania State University, 2022.
■506 ▼aThis item must not be sold to any third party vendors.
■590 ▼aSchool code: 0176.
■650 4▼aDecomposition.
■650 4▼aDynamic programming.
■650 4▼aAlgorithms.
■650 4▼aGraphs.
■650 4▼aTraveling salesman problem.
■650 4▼aComputer science.
■650 4▼aOperations research.
■690 ▼a0984
■690 ▼a0796
■71020▼aThe Pennsylvania State University.
■7730 ▼tDissertations Abstracts International▼g84-02B.
■773 ▼tDissertation Abstract International
■790 ▼a0176
■791 ▼aPh.D.
■792 ▼a2022
■793 ▼aEnglish
■85640▼uhttp://www.riss.kr/pdu/ddodLink.do?id=T16618681▼nKERIS▼z이 자료의 원문은 한국교육학술정보원에서 제공합니다.
■980 ▼a202302▼f2023
