Homework #1

Due ??

• an easy problem
• Factor the graph given in the following figure using the algorithm 2-factor given in Lecture 3. Draw a separate picture for each step of the algorithm.
• Consider the migration problem on a demand graph with 4 nodes and maximum degree . Is there an algorithm which will always
• Devise an algorithm for migration in the case where in each time step, each device can both receive and send an object. Can you get an optimal algorithm?