Mathematics
Subgraph
100%
Lower bound
92%
Directed Graph
87%
Graph in graph theory
68%
Streaming
68%
Exponential time
67%
Exact Algorithms
58%
Vertex of a graph
50%
Multiway Cut
49%
Planar graph
46%
Steiner network
45%
Hardness
44%
Fixed-parameter Tractability
43%
Feedback Vertex Set
40%
Parameterized Complexity
38%
Path
37%
Dynamic Graphs
37%
Edge-disjoint Paths
34%
Kernelization
33%
Parameterized Algorithms
33%
Subset
31%
Sparse Graphs
30%
Approximation Algorithms
28%
Redundancy
28%
Deletion
27%
Nearest Neighbor
26%
Weighted Graph
25%
NP-complete problem
25%
Fast Algorithm
25%
Point Sets
25%
Undirected Graph
22%
Counting
21%
Colouring
21%
Contraction
21%
Constraint Satisfaction Problem
19%
Framework
19%
Cutset
18%
Training
18%
Induced Subgraph
18%
Integer
17%
Computational Complexity
17%
Homomorphism
16%
Treewidth
16%
Separator
14%
Vertex Cover
14%
Euclidean space
13%
Asymptotically Optimal
13%
Approximation Scheme
13%
Hitting Set
13%
Demand
12%
Engineering & Materials Science
Directed graphs
67%
Hardness
48%
Approximation algorithms
46%
NP-hard
40%
Computational complexity
39%
Labels
34%
Polynomials
34%
Coloring
30%
Anchors
25%
Condensation
25%
Set theory
21%
Redundancy
21%
Feedback
18%
Byproducts
8%
Dynamic programming
8%
Separators
6%
Costs
6%
Dynamic models
6%
Towers
5%
Supervised learning
5%
Lenses
5%