Skip to main navigation
Skip to search
Skip to main content
IT-University of Copenhagen Home
Support to ITU faculty
Dansk
English
Home
Organisation
Researchers
Projects
Publications
Datasets
Press/Media
Activities
Prizes
Search by expertise, name or affiliation
Exponential-Time Algorithms and Complexity of NP-Hard Graph Problems
Nina Sofia Taslaman
Research output
:
Theses
›
PhD thesis
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Exponential-Time Algorithms and Complexity of NP-Hard Graph Problems'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Time Complexity
100%
Planar Graph
100%
NP-hard Graph Problem
100%
Exponential-time Algorithms
100%
Simple Graph
66%
Partition Function
33%
Graph Theory
33%
Polynomial Time
33%
Time Requirement
33%
Tight Bounds
33%
High Probability
33%
3-SAT
33%
Hamiltonian Cycle
33%
Exponential Time
33%
General Graphs
33%
Tutte Polynomial
33%
Potts Model
33%
Monte Carlo Algorithm
33%
Cycle Graph
33%
Superpolynomials
33%
NP-hard Problem
33%
Doubly Exponential
33%
Exponential Time Hypothesis
33%
Three-state
33%
Brute Force
33%
Model Partition
33%
Mathematics
Exponential Time
100%
Planar Graph
100%
Upper Bound
66%
Partition Function
33%
Polynomial
33%
Running Time
33%
Probability Theory
33%
Fixed Points
33%
Simple Graph
33%
Hamiltonian Cycle
33%
NP-hard Problem
33%
Edge
33%
Monte Carlo Algorithm
33%
Polynomial Time
33%