Mathematics
Kernelization
100%
Polynomial Time
96%
Polynomial
87%
Running Time
46%
Search Space
45%
Transversals
37%
Exponential Time
33%
Open Neighbourhood
33%
Minimizes
30%
Edge
30%
Integer
25%
Planar Graph
24%
Closed Graph
23%
Graph Coloring
22%
Induced Subgraph
22%
Lower and upper bounds
22%
Open Problem
19%
Approximates
19%
Counting Problem
15%
Clique
15%
Packing Problem
15%
Finite Family
15%
Unit Length
15%
Sparse Graphs
15%
Worst Case
15%
Computer Science
Polynomial Time
60%
Tractable Algorithm
45%
Directed Graphs
37%
polynomial-time algorithm
30%
Double Exponential
30%
Planar Graph
27%
Exact Algorithm
22%
Subgraphs
19%
Quality Measure
15%
Resulting Graph
15%
Testing Problem
15%
Approximation (Algorithm)
15%
Graph Theory
15%
Fundamental Problem
15%
Sparsity
15%
Precedence Constraint
15%
Packing Problem
15%
Future Development
15%
Time Complexity
15%
Polynomial Space
15%
Decision Problem
15%
Space Complexity
15%
Hamiltonian Cycle
15%
Bipartite Graph
15%
Algorithmic Complexity
15%