Skip to main navigation
Skip to search
Skip to main content
Utrecht University Home
Help & FAQ
Home
Profiles
Research units
Research output
Activities
Press/Media
Prizes
Search by expertise, name or affiliation
Exact Exponential-Time Algorithms for Domination Problems in Graphs
J.M.M. van Rooij
Research output
:
Thesis
›
Doctoral thesis 1 (Research UU / Graduation UU)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Exact Exponential-Time Algorithms for Domination Problems in Graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Exact Exponential Algorithms
100%
Domination Problems
100%
Time Algorithm
77%
Graph Decomposition
44%
Dominating Set
33%
Subset Problems
33%
Graph Domination
33%
Total Dominating Set
22%
Inclusion-exclusion
22%
Partial Dominating Set
22%
Edge Dominating Set
22%
Dynamic Programming Algorithm
11%
Tree Decomposition
11%
Neighborhood Relation
11%
Parameterized Algorithms
11%
Operation number
11%
State-based
11%
Exponential Time
11%
Branch Decomposition
11%
Fast Algorithm
11%
Convolution Algorithm
11%
Criteria-based
11%
Graph Algorithms
11%
Dominating Set Problem
11%
Complexity Parameter
11%
Decomposition Tree
11%
Algorithm Design
11%
Graph Width Parameters
11%
Clique Decomposition
11%
Fast Subset Convolution
11%
Mathematics
Exponential Time
100%
Dominating Set
100%
Edge
30%
Dominates
30%
Running Time
20%
Independent Set
20%
Worst Case
20%
Polynomial
10%
Convolution
10%
Clique
10%
Design of algorithm
10%
Fast Algorithm
10%
Neighborhood Relation
10%