Keyphrases
Vertex Failures
80%
Cut Vertex
80%
Vertex-cut
80%
Sensing Cost
80%
Distributed Computation
80%
Near-optimal
80%
Labeling Scheme
80%
Regular Languages
53%
Randomized Algorithms
53%
Vertex Connectivity
53%
Spanners
53%
Fault-tolerant
53%
Complexity Measures
47%
Fault-tolerant Spanner
40%
Routing Scheme
40%
Graph Coloring
40%
Oracle
40%
Fault Model
40%
Linear Graphs
39%
Graph Drawing
39%
Tree Decomposition
34%
Light-tree
34%
Cut Edge
26%
Cut Pair
26%
Single-cut
26%
D-diameter
26%
Sketching Techniques
26%
Minimal Automata
26%
Random Inputs
26%
Successor States
26%
Finite Sets
26%
Language-based
26%
Automata
26%
Distributed Algorithms
26%
Maximum Degree
26%
Pritchard
26%
Optimal Algorithm
26%
Sublinear Algorithms
26%
Distributed Settings
26%
Graph Connectivity
26%
Distributed Computing
26%
Edge Cut
26%
Cut Value
26%
Algorithmic Approach
26%
CONGEST Model
26%
General Graphs
21%
Number of Vertices
20%
Crash
20%
Size Bounds
13%
Graph Decomposition
13%
Computer Science
Labeling Scheme
100%
Fault Tolerant
100%
Vertex Connectivity
80%
Randomized Algorithm
80%
Distributed Computation
80%
Automaton
80%
Regular Language
80%
Complexity Measure
68%
routing scheme
60%
Tree Decomposition
48%
Subgraphs
46%
Sketching Technique
40%
Truth Assignment
40%
Successor State
40%
Distributed Algorithm
40%
Distributed Computing
40%
Optimal Algorithm
40%
Algorithmic Approach
40%
Topology Graph
20%
Distributed Data Structure
8%
Greedy Algorithm
6%
