Quickly Coloring a Graph's Edges -


suppose greedily assigning colors edges of graph g = (v,e) follows,

  1. select uncolored edge (u,v)
  2. identify colors of edges touching u , select lowest unused color. same v.
  3. assign (u,v) larger of 2 colors.

a trivial way perform step 2 check colors 1,2,... until coming across 1 not used edge touching u. there faster way?

just @ this. depending on yout want, can have variations of algorithms can have performance boost, wether you're looking 1 or solutions.


Comments

Popular posts from this blog

blackberry 10 - how to add multiple markers on the google map just by url? -

php - guestbook returning database data to flash -

delphi - Dynamic file type icon -