A fast distributed algorithm for (Δ + 1)-edge-coloring
Anton Bernshteyn
Topics & Concepts
Edge coloringCombinatoricsVertex (graph theory)Greedy coloringBrooks' theoremMathematicsMatching (statistics)Fractional coloringDistributed algorithmGraphEnhanced Data Rates for GSM EvolutionBinary logarithmList coloringUpper and lower boundsDiscrete mathematicsGraph coloringComplete coloringAlgorithmComputer scienceLine graphDistributed computingArtificial intelligenceGraph powerStatisticsMathematical analysis1-planar graphComplexity and Algorithms in GraphsOptimization and Search ProblemsAdvanced Graph Theory Research