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