Login / Signup

A self-stabilizing (Delta+4)-edge-coloring algorithm for planar graphs in anonymous uniform systems.

Chi-Hung TzengJehn-Ruey JiangShing-Tsaan Huang
Published in: Inf. Process. Lett. (2007)
Keyphrases
  • dynamic programming
  • worst case
  • expectation maximization
  • k means
  • np hard
  • planar graphs
  • optimal solution
  • computational complexity
  • objective function
  • probabilistic model
  • linear programming
  • minimum weight