Suppose you are given an undirected graph with associated e…

Suppose you are given an undirected graph with associated edge costs which are all positive and distinct and let be a shortest-path from node to node in . Now replace all edge costs by a new cost , thereby creating a new instance of the problem with the same graph set of nodes and set of edges but modified edge costs. Select all options below where would still be guaranteed to be a shortest path from to in this new instance of the graph (with modified edge costs ): For the following statements, select True or False. 1)

Which of the following statements are true regarding the sta…

Which of the following statements are true regarding the standard version of the stable matching problem given advisors and students seen in lecture. For all the statements, select True or False. 1) An unmatched pair  is unstable with respect to a matching  if advisor a and student s prefer each other to their current pairings assigned by . [1]  2) The standard propose-and-reject algorithm seen in lecture may run for