본문

서브메뉴

Parameterization and Concise Representation in Graph Algorithms: Leaf Powers, Subgraphs with Hereditary Properties, and Activity-on-Edge Minimization
Parameterization and Concise Representation in Graph Algorithms: Leaf Powers, Subgraphs wi...
Parameterization and Concise Representation in Graph Algorithms: Leaf Powers, Subgraphs with Hereditary Properties, and Activity-on-Edge Minimization

Detailed Information

자료유형  
 학위논문파일 국외
최종처리일시  
20220210093311
ISBN  
9798522970000
DDC  
004
저자명  
Havvaei, Elham.
서명/저자  
Parameterization and Concise Representation in Graph Algorithms: Leaf Powers, Subgraphs with Hereditary Properties, and Activity-on-Edge Minimization
발행사항  
[Sl] : University of California, Irvine, 2021
발행사항  
Ann Arbor : ProQuest Dissertations & Theses, 2021
형태사항  
93 p
주기사항  
Source: Dissertations Abstracts International, Volume: 83-02, Section: B.
주기사항  
Advisor: Eppstein, David.
학위논문주기  
Thesis (Ph.D.)--University of California, Irvine, 2021.
사용제한주기  
This item must not be sold to any third party vendors.
일반주제명  
Computer science
일반주제명  
Information science
일반주제명  
Applied mathematics
일반주제명  
Phylogenetics
일반주제명  
Dynamic programming
일반주제명  
Power
일반주제명  
Endangered & extinct species
일반주제명  
Logic
일반주제명  
Graph representations
일반주제명  
Dissertations & theses
일반주제명  
Teaching assistants
일반주제명  
Trees
일반주제명  
Biology
일반주제명  
Algorithms
일반주제명  
Complexity theory
일반주제명  
Visualization
키워드  
Activity-on-edge graphs
키워드  
Critical paths
키워드  
Hereditary properties
키워드  
Leaf powers
키워드  
Parameterized complexity
키워드  
Phylogenetics
기타저자  
University of California, Irvine Computer Science - PhD
기본자료저록  
Dissertations Abstracts International. 83-02B.
기본자료저록  
Dissertation Abstract International
전자적 위치 및 접속  
로그인 후 원문을 볼 수 있습니다.

MARC

 008220131s2021        us                              c    eng  d
■001000016052537
■00520220210093311
■020    ▼a9798522970000
■035    ▼a(MiAaPQ)AAI28544281
■040    ▼aMiAaPQ▼cMiAaPQ
■0820  ▼a004
■1001  ▼aHavvaei,  Elham.
■24510▼aParameterization  and  Concise  Representation  in  Graph  Algorithms:  Leaf  Powers,  Subgraphs  with  Hereditary  Properties,  and  Activity-on-Edge  Minimization
■260    ▼a[Sl]▼bUniversity  of  California,  Irvine▼c2021
■260  1▼aAnn  Arbor▼bProQuest  Dissertations  &  Theses▼c2021
■300    ▼a93  p
■500    ▼aSource:  Dissertations  Abstracts  International,  Volume:  83-02,  Section:  B.
■500    ▼aAdvisor:  Eppstein,  David.
■5021  ▼aThesis  (Ph.D.)--University  of  California,  Irvine,  2021.
■506    ▼aThis  item  must  not  be  sold  to  any  third  party  vendors.
■590    ▼aSchool  code:  0030.
■650  4▼aComputer  science
■650  4▼aInformation  science
■650  4▼aApplied  mathematics
■650  4▼aPhylogenetics
■650  4▼aDynamic  programming
■650  4▼aPower
■650  4▼aEndangered  &  extinct  species
■650  4▼aLogic
■650  4▼aGraph  representations
■650  4▼aDissertations  &  theses
■650  4▼aTeaching  assistants
■650  4▼aTrees
■650  4▼aBiology
■650  4▼aAlgorithms
■650  4▼aComplexity  theory
■650  4▼aVisualization
■653    ▼aActivity-on-edge  graphs
■653    ▼aCritical  paths
■653    ▼aHereditary  properties
■653    ▼aLeaf  powers
■653    ▼aParameterized  complexity
■653    ▼aPhylogenetics
■690    ▼a0984
■690    ▼a0723
■690    ▼a0364
■690    ▼a0395
■690    ▼a0306
■71020▼aUniversity  of  California,  Irvine▼bComputer  Science  -  Ph.D..
■7730  ▼tDissertations  Abstracts  International▼g83-02B.
■773    ▼tDissertation  Abstract  International
■790    ▼a0030
■791    ▼aPh.D.
■792    ▼a2021
■793    ▼aEnglish
■85640▼uhttp://www.riss.kr/pdu/ddodLink.do?id=T16052537▼nKERIS▼z이  자료의  원문은  한국교육학술정보원에서  제공합니다.
■980    ▼a202202▼f2022

Preview

Export

ChatGPT Discussion

AI Recommended Related Books


    New Books MORE
    Statistics for the past 3 years. Go to brief

    Подробнее информация.

    • Бронирование
    • не существует
    • моя папка
    • Первый запрос зрения
    • Non-Book Loan Application
    • Nighttime Book Loan Application
    материал
    Reg No. Количество платежных Местоположение статус Ленд информации
    TF03031 원문서버(전산정보실) 대출불가 My Folder 부재도서신고 비도서대출신청

    * Бронирование доступны в заимствований книги. Чтобы сделать предварительный заказ, пожалуйста, нажмите кнопку бронирование

    Books borrowed together with this book

    Related Popular Books

    Available after logging in.