Ahmed Kouider

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
x A unit-time scheduling problem with makespan criterion may b e i n terpreted as an optimal coloring : V ! f 1 2 : : : : t g of the vertices V = fv 1 v 2 : : : : v n g of a mixed graph (V AA E) where the number t of colors is minimal, (v i) < < (v j) for each arc (v i v j) 2 A, and (v p) 6 = (v q) for each edge v p v q ] 2 E. W e consider an optimal(More)
  • 1