Computer Science
Fault Tolerant
99%
Subgraphs
87%
Distributed Algorithm
50%
Parallel Computation
34%
Distributed Computing
32%
Directed Graph
28%
Randomized Algorithm
26%
Wireless Network
25%
Neural Network
24%
Labeling Scheme
23%
Polynomial Time Algorithm
21%
Spanning Tree
21%
Weighted Graph
18%
Vertex Connectivity
18%
Planar Graph
17%
Distributed Computation
16%
Transitive Closure
15%
Connectivity Problem
15%
Distributed Network
15%
steiner tree
14%
routing scheme
14%
Interfering Signal
14%
Secure Algorithm
14%
Approximation (Algorithm)
13%
Constant Factor
13%
Network Design
13%
Time Complexity
13%
Neural Computation
12%
Maximal Independent Set
12%
Connected Graph
10%
Approximation Algorithm
10%
Network Optimization
10%
Natural Barrier
9%
Constant Value
9%
Wireless Communication
9%
Discretization
9%
digraph
9%
Distributed Language
9%
Success Probability
9%
Algorithmic Approach
9%
optimal power
9%
Connected Subgraph
9%
Communication Graph
9%
Polynomial Time
9%
Optimization Problem
9%
Sampling Technique
8%
Multiplicative Factor
8%
Sparsity
7%
Fast Algorithm
7%
Message Passing
7%
Keyphrases
Fault-tolerant
61%
Spanners
40%
Unweighting
36%
Log-log
34%
Wireless Communication
29%
SINR Model
28%
Congested Clique
24%
Hopsets
24%
Massively Parallel Computation
24%
Shortest Path
24%
Distributed Algorithms
19%
Interference Cancellation
19%
Deterministic Algorithm
19%
Time Algorithm
18%
Resilient
18%
Maximum Degree
18%
Distance Preservers
18%
Linear Size
18%
CONGEST Model
16%
Point Location
16%
Tight
16%
Replacement Paths
16%
Connection Problem
15%
CONGEST
15%
Labeling Scheme
15%
Vertex Failures
15%
Additive Spanners
15%
Bounded Degree Graphs
14%
Voronoi Diagram
14%
Wireless Networks
14%
Derandomization
14%
Power Assignment
14%
Distributed Construction
14%
Time Complexity
12%
Edge Failure
12%
Compiler
12%
Breadth-first Search
12%
Graph Spanners
12%
Number of Connected Components
12%
Distributed Network
12%
Interfering Signals
12%
Deterministic Construction
12%
Distributed Computing
11%
Power Control
11%
Spiking Neural Networks
11%
K-edge
11%
Congested Clique Model
11%
Additive Stretch
11%
Randomized Algorithms
11%
Search Structures
10%
Mathematics
Edge
100%
Approximates
37%
Point Location
21%
Nonuniform
21%
Clique
20%
Polynomial Time
19%
Polynomial
19%
Maximum Degree
18%
Connected Component
17%
Neural Network
15%
Derandomization
14%
Probability Theory
14%
Topological Property
13%
Path Problem
13%
Upper Bound
13%
Planar Graph
10%
Conditionals
9%
One Dimension
9%
Discretization
9%
Geometric Object
9%
Hitting Set
8%
Frobenius Theorem
8%
Multiplicative
8%
Transitive Closure
7%
Main Result
7%
Integer
6%
Spiking Neuron
6%
Matrix (Mathematics)
6%
Expander
6%
Path Loss
5%
Logarithmic Term
5%
Irreducibility
5%
Weighted Graph
5%
Independent Set
5%
Fatness
5%
