Skip to main navigation
Skip to search
Skip to main content
Sort by
Keyphrases
2-SAT
7%
3-SAT
8%
Algorithm Use
7%
All-pairs
22%
All-pairs Shortest Paths
26%
Approximation Algorithms
52%
Approximation Ratio
13%
Boolean Functions
11%
Caching
6%
Constant Time
6%
Directed Graph
27%
Distance Queries
7%
Dynamic Reachability
6%
Edge Weight
19%
Electric Car
6%
EREW PRAM
9%
Improved Approximation
11%
Linear Programming
6%
Log-log
12%
MaxCut
20%
MaxSAT
7%
Mean-payoff Games
9%
NAE-SAT
7%
NP-hard
8%
Number of Edges
20%
Number of Vertices
16%
Optimal Strategy
6%
Polynomial Time
10%
Priority Queue
12%
Private Randomness
6%
Query Response Time
8%
Randomized Algorithms
7%
Reachability Algorithm
6%
Read-once Formulas
6%
Semidefinite Programming
17%
Shortest Path
19%
Simple Cycle
8%
Spanning Forest
6%
Tight
19%
Time Algorithm
23%
Total Weight
6%
Undirected Graph
36%
Undirected Weighted Graph
14%
Union-find Data Structure
6%
Unique Games Conjecture
7%
Unweighted
11%
Unweighted Graph
7%
Update Time
6%
Weighted Directed Graph
12%
Weighted Graph
8%
Mathematics
Adjacency
7%
Approximability
9%
Approximates
21%
Best Approximation
8%
Boolean Function
16%
Communication Protocol
5%
Constant Factor
5%
Constant Time
9%
Cycle Length
5%
Data Structure
30%
Edge
100%
Energetics
6%
EREW PRAM
6%
Flat Surface
9%
Integer
24%
Linear Program
7%
Markov Decision Process
8%
Matching Problem
5%
Matrix (Mathematics)
15%
Matrix Multiplication
12%
Maximum Degree
6%
Median
11%
Open Problem
22%
Optimal Strategy
9%
Path Problem
17%
Polynomial
9%
Polynomial Time
28%
Probability
13%
Rounding
17%
Rounding Procedure
8%
Running Time
25%
Simplex Algorithm
9%
Stochastic Game
7%
Symmetric Boolean Function
6%
Total Number
9%
Upper Bound
16%
Weight Function
5%
weighted graph
16%
Weighted Undirected Graph
14%
Worst Case
40%
Computer Science
Approximation (Algorithm)
8%
Approximation Algorithms
30%
Boolean Function
8%
Communication Complexity
6%
Constraint Satisfaction Problems
5%
Data Structure
41%
Delete Operation
6%
Directed Graphs
68%
Efficient Algorithm
5%
Fast Algorithm
5%
Markov Decision Process
8%
Optimal Strategy
6%
Pair Shortest Path
11%
Pair Shortest Path Problem
8%
Polynomial Time
17%
Probability
6%
Proof
13%
Semidefinite Programming
11%
Shortest Path Algorithm
5%
Shortest Path Problem
11%
Spanning Tree
5%
Transitive Closure
5%
weighted graph
6%
