Mathematics
Approximation Algorithms
73%
Shortest path
54%
Directed Graph
51%
Undirected Graph
51%
Graph in graph theory
48%
Heap
35%
Shortest Path Problem
31%
Weighted Graph
30%
Game
30%
Lower bound
30%
EREW PRAM
30%
Priority Queue
30%
Path
29%
Spanners
28%
Reachability
26%
Data Structures
26%
Semidefinite Programming
25%
Costs
25%
Rounding
25%
Cycle
23%
Matrix multiplication
23%
Max-cut Problem
22%
Parity
20%
Query
20%
Communication Complexity
18%
Stretch
18%
Boolean Functions
17%
Vertex of a graph
16%
Paging
15%
Competitive Analysis
15%
Equitable Coloring
14%
Deletion
14%
String Matching
14%
Rendezvous
14%
Spanning Forest
14%
Markov Decision Process
13%
Monotone
13%
Efficient Algorithms
13%
Minimum Cut
13%
Cycle Length
13%
Time Constant
13%
Polynomial time
13%
Shrinkage
13%
Routing
13%
Semidefinite Program
12%
Approximability
12%
Bisection
12%
Multi-criteria
12%
Logarithmic
12%
Multiplication
12%
Engineering & Materials Science
Approximation algorithms
100%
Directed graphs
92%
Data structures
48%
Polynomials
42%
Boolean functions
37%
Coloring
23%
NP-hard
21%
Costs
16%
Sorting
15%
Constraint satisfaction problems
13%
Networks (circuits)
13%
Labels
12%
Random access storage
12%
Communication
11%
Adders
11%
Color
11%
Network protocols
10%
Amplification
10%
Markov processes
9%
Hardness
9%
Protein folding
8%
Labeling
8%
Relaxation
8%
Linear programming
7%
Computer science
6%
Brick
5%
Sampling
5%
