Fully-Dynamic Graph Algorithms with Sublinear Time Inspired by Distributed Computing

Keyphrases

• Sublinear Time 100%
• Distributed Computing 100%
• Dynamic Graph Algorithms 100%
• Update Time 100%
• Fully Dynamic Graphs 100%
• Maximal Matching 80%
• General Graphs 80%
• Edge Coloring 80%
• Deterministic Algorithm 60%
• Distributed Algorithms 40%
• Fully Dynamic 40%
• Dense Graphs 40%
• Time Deterministic 40%
• High Efficiency 20%
• Matching Algorithm 20%
• Coloring Algorithm 20%
• Edge Set 20%
• Large Families 20%
• Dynamic Setting 20%
• Vertex Set 20%
• Dynamic Graph 20%
• Matching Graph 20%
• Central Processor 20%
• Network Scenarios 20%
• Dynamic Networks 20%
• Sublinear Update Time 20%
• Network Topology 20%

Computer Science

• Maximal Matching 100%
• Distributed Computing 100%
• Graph Algorithms 100%
• Distributed Algorithm 50%
• Matching Algorithm 25%
• Network Topology 25%
• Dynamic Network 25%