Keyphrases
Distance Oracles
51%
Fault-tolerant
51%
Update Time
39%
Edge Weight
37%
Shortest Path
35%
Query Response Time
33%
General Graphs
28%
Near-optimal
25%
Fully Dynamic
25%
Spanners
24%
All-pairs Shortest Paths
24%
Single-source Shortest Paths
23%
Directed Graph
23%
Routing Scheme
23%
Path Problems
22%
Randomized Algorithms
21%
Approximate Distance Oracles
21%
Decremental
19%
Replacement Paths
18%
Sparse Graphs
18%
Planar Graph
17%
Edge Failure
17%
Undirected Graph
17%
Unweighting
17%
Distance Label
16%
Distance Sensitivity Oracle
16%
Subquadratic
16%
Compact Routing
16%
Fault-tolerant Spanner
15%
Spanning Tree
13%
Undirected Weighted Graph
13%
Fast Algorithm
13%
Set Distance
12%
Forbidden Set
12%
CONGEST Model
12%
Oracle
12%
Unweighted Graph
12%
K-edge
12%
Approximation Algorithms
12%
Number of Vertices
12%
Labeling Scheme
11%
Weighted Directed Graph
11%
Total Weight
11%
Forbidden Edges
11%
Approximation Ratio
11%
Forster
11%
Time Algorithm
10%
Deterministic Algorithm
9%
Low Distortion
9%
Tight
9%
Computer Science
Fault Tolerant
56%
Directed Graphs
55%
Data Structure
38%
Approximation (Algorithm)
35%
Randomized Algorithm
35%
routing scheme
26%
Subgraphs
24%
weighted graph
23%
Pair Shortest Path
23%
Spanning Tree
21%
Shortest Path Problem
19%
Planar Graph
18%
Labeling Scheme
15%
digraph
12%
Underlying Network
11%
Shortest Path Tree
10%
Triangle Inequality
10%
Fast Algorithm
9%
Polynomial Time
9%
Pair Shortest Path Problem
9%
Metric Space
9%
Preprocessing Time
9%
Social Network
9%
Polynomial Time Algorithm
9%
Location Problem
8%
Nonnegative Integer
8%
Optimal Algorithm
8%
Connected Graph
8%
Connectivity Problem
8%
Distributed Computing
8%
steiner tree
8%
Constant Factor
7%
Connected Subgraph
7%
Negative Edge Weight
6%
Algebraic Algorithm
6%
Time Complexity
5%
Positive Integer
5%
Minimum Spanning Tree
5%
Mathematics
Edge
100%
Approximates
55%
Path Problem
35%
Running Time
17%
Data Structure
16%
Spanning Tree
15%
Integer
14%
Multiplicative
14%
Sparse Graphs
13%
Polynomial
12%
Main Result
12%
Worst Case
11%
Fast Algorithm
10%
Minimizes
9%
Metric Space
9%
Maximum Degree
8%
Social Network Analysis
8%
K-Center
8%
Polynomial Time
7%
Conditionals
7%
weighted graph
7%
Weighted Undirected Graph
7%
Linear Time
7%
Constant Factor
7%
Minimum Spanning Tree
7%
Open Question
6%
Total Weight
5%
Probability Theory
5%
Positive Integer
5%
