Keyphrases
Approximation Algorithms
42%
Bit Complexity
36%
Incremental Maintenance
32%
Edge-connectivity
27%
K-edge
26%
Carcass
24%
Connected Spanning Subgraph
24%
Tower of Hanoi
24%
Undirected Graph
21%
Connected Graph
21%
Pooles
20%
Software-defined Networking
20%
NP-hard
19%
Communication Cost
19%
Wood
19%
Maximum Flow
18%
Connection Network
16%
Unsplittable Flow Problem
16%
Unsplittable Flow
16%
Absolute Bound
16%
Light-tree
16%
Low Light
16%
Euclidean Spanners
16%
Tight Lower Bound
16%
Unweighting
16%
Extended Abstracts
16%
Rectangle
16%
Load Balancing
16%
General Graphs
16%
Optimal Algorithm
16%
Message Complexity
15%
Edge Insertion
14%
Ring Topology
13%
Movement Sequence
13%
Balanced State
13%
2-approximation
13%
Rooted Trees
13%
Tight
13%
Congestion
13%
Equivalence Class
13%
Minimum Weight
12%
Tight Bounds
12%
Homeomorphic
12%
Path Problems
12%
Node number
12%
Minimum Edge Cut
11%
Orientable
11%
Maximum Demand
10%
Exact Bounds
10%
Leader Election
10%
Computer Science
Directed Graphs
54%
Approximation Algorithms
35%
Communication Cost
24%
digraph
24%
Data Structure
20%
Spanning Tree
20%
Connected Graph
16%
Polynomial Time
16%
Equivalence Class
16%
Optimal Algorithm
16%
Consensus Task
16%
Time Complexity
16%
Transmitted Bit
16%
Message Passing
16%
Asynchronous Message
16%
Measure of Complexity
16%
Balanced State
16%
Load Balancing
16%
Shortest Path Tree
16%
Solving Algorithm
12%
Distributed Algorithm
12%
Shortest Path Problem
12%
Dependence Graph
10%
Metric Space
9%
Constant Factor
9%
Programming Technique
8%
Connected Component
8%
Subgraphs
8%
Dijkstra Algorithms
8%
polynomial-time algorithm
8%
Parametric Search
8%
Knapsack Problem
8%
Technical Report
8%
Software-Defined Networking
8%
Routing Problem
8%
Communication Network
8%
Exponential Number
8%
Linear Programming
8%
Representing Tree
8%
Source Codes
8%
Frequency Division Multiple Access
8%
Search Heuristic
8%
Communication Complexity
8%
Distributed Computing
8%
Cardinality
8%
Load Balancing Problem
8%
Execution Progress
8%
Software-Defined Network
8%
OpenFlow
8%
Greedy Algorithm
8%
Mathematics
Edge
100%
Tower of Hanoi
24%
Edge-Connectivity
24%
Upper Bound
23%
Integer
20%
Connected Graph
18%
Data Structure
17%
Simple Graph
16%
Optimality
16%
Running Time
16%
Minimum Spanning Tree
14%
Spanning Tree
13%
Arbitrary Sequence
12%
Lower and upper bounds
12%
Constant Factor
11%
Source Coding
9%
Asymmetric
9%
Cardinality
8%
Theoretic Term
8%
Absolute Error
8%
Additive Constant
8%
Lattice Point
8%
Planarity
8%
Vertex of a Graph
8%
Polynomial Time
8%
Dot Operator
8%
Ring Topology
8%
Additional Time
8%
Matching Problem
8%
Metric Space
7%
Worst Case
6%
Open Problem
5%
Positive Integer
5%
Dimensional Euclidean Space
5%
Greedy Algorithm
5%
Path Problem
5%
Equivalence Class
5%
