Sign in

New Linear-Time Algorithms for Edge-Coloring Planar Graphs.

Richard ColeLukasz Kowalik
Published in: Algorithmica (2008)
Keyphrases
  • planar graphs
  • worst case
  • edge detection
  • edge information
  • objective function
  • computational complexity
  • probabilistic model
  • max cut