Keyphrases
Treewidth
100%
Path Length
44%
Parameterized Complexity
43%
Bounded Treewidth
26%
Tree Decomposition
24%
Polynomial Time
22%
NP-complete
22%
Linear Time
19%
Parameterized Problems
18%
Gonality
18%
Polynomial-time Algorithm
18%
Graph Classes
17%
Graph Coloring
16%
Planar Graph
15%
Polynomial Kernel
14%
Kernelization
14%
Linear-time Algorithm
14%
Exponential-time Algorithms
13%
Fixed-parameter Tractability
12%
Exact Algorithm
12%
Emulation
11%
Steiner Tree
11%
Feedback Vertex Set
11%
Approximation Algorithms
11%
Kd-tree
11%
Dynamic Programming
11%
Cograph
11%
Graph Isomorphism
11%
Interval Graphs
11%
Tight
10%
Vertex Cover
10%
Monadic Second-order Logic
10%
NP-hard
9%
Graph Problems
9%
Dominating Set
9%
Dynamic Programming Algorithm
8%
Definability
8%
Recognizability
8%
Cutwidth
8%
NP-completeness
8%
Winning Strategy
8%
Triangulating
8%
Connection Problem
7%
Hereditary Graph Class
7%
Parameterized Algorithms
7%
Tree Partitioning
7%
Undirected Graph
7%
K Parameter
7%
Exponential Time Hypothesis
7%
Cross-composition
7%
Mathematics
Polynomial Time
61%
Polynomial
47%
Linear Time
42%
Edge
35%
Kernelization
21%
Connected Graph
21%
Integer
20%
Free Graph
19%
Running Time
18%
Exponential Time
18%
Upper Bound
17%
Planar Graph
17%
Dominating Set
15%
Interval Graph
15%
Path Decomposition
11%
Bipartite Graph
10%
Open Problem
10%
Winning Strategy
9%
Induced Subgraph
8%
Definability
8%
Subsequence
8%
Connected Component
7%
Matrix
7%
Positive Integer
7%
Independent Set
7%
Permutation
7%
weighted graph
7%
Constant Factor
7%
Maximum Degree
7%
Clique
6%
Approximates
6%
Graph Coloring
6%
Reduction Algorithm
6%
Cube
6%
Sequence Alignment
6%
Hamiltonian Cycle
6%
Linear Programming
6%
Clique-width
6%
Open Question
5%
Weighted Tree
5%
Partition Tree
5%
Computer Science
Polynomial Time
26%
Planar Graph
15%
Directed Graphs
11%
Tree Decomposition
10%
Scheduling Problem
10%
Dynamic Programming
9%
Parameter Value
9%
Complexity Class
9%
Polynomial Hierarchy
9%
Exact Algorithm
8%
Bayesian Networks
8%
Partition Tree
8%
Connectivity Problem
7%
Computational Complexity
7%
Second-Order Logic
7%
polynomial-time algorithm
7%
Dynamic Programming Algorithm
7%
Directed Acyclic Graph
6%
Connected Component
6%
Connected Graph
6%
Communication Graph
6%
Wireless Network
6%
Positive Integer
6%
Parallel Algorithm
6%
Approximation Algorithms
5%
Precedence Constraint
5%
Multiprocessor System
5%
NP-completeness
5%
Sequence Alignment
5%
Bipartite Graph
5%
