Login / Signup

Fast Parallel and Sequential Algorithms for Edge-Coloring Planar Graphs.

Marek ChrobakMoti Yung
Published in: AWOC (1988)
Keyphrases
  • planar graphs
  • worst case
  • optimization problems
  • weighted graph
  • computational complexity
  • random walk