Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition

Keyphrases

• Forest Decomposition 100%
• Bounded Degree 100%
• Sparse Graphs 100%
• Graph Families 50%
• Maximal Independent Set 50%
• Distributed Algorithms 50%
• Planar Graph 50%
• Graph Coloring 50%
• Bounded Arboricity 50%
• Oriented Graph 50%
• Bounded Genus Graphs 50%
• Large Families 50%
• Oriented Tree 50%
• Bounded Treewidth Graphs 50%
• Graph-theoretic 50%
• Tight Lower Bound 50%

Mathematics

• Running Time 100%
• Sparse Graphs 100%
• Arboricity 50%
• Graph Coloring 50%
• Independent Set 50%
• Theoretic Structure 50%
• Sublogarithmic Algorithm 50%
• Planar Graph 50%