About ComputerScienceExpert

Levels Tought:
Elementary,Middle School,High School,College,University,PHD

Expertise:

Applied Sciences,Calculus See all

Applied Sciences,Calculus,Chemistry,Computer Science,Environmental science,Information Systems,Science Hide all

Teaching Since:	Apr 2017
Last Sign in:	9 Weeks Ago, 3 Days Ago
Questions Answered:	4870
Tutorials Posted:	4863

Education

MBA IT, Mater in Science and Technology
Devry
Jul-1996 - Jul-2000

Experience

Professor
Devry University
Mar-2010 - Oct-2016

Category > Programming Posted 26 Apr 2017 My Price 8.00

Consider an edge weighted graph G

Consider an edge weighted graph G with weights w[。], and a minimum spanning tree of the graph,

T. Suppose for some edge (u v) you decrease w[uv] to be w*. Describe a procedure (pseudocode is

unnecessary) that would nd the new MST with the updated weight. Your algorithm must run faster than

recomputing the MST from scratch, i.e., o(|E| log |V|). Give the running time of your procedure.

b. Consider an edge weighted graph G with weights w[-], and a minimum spanning tree of the graph,
T. Suppose for some edge (um) you decrease w[u,v] to be 10*. Describe a procedure (pseudocode is
unnecessary) that would ﬁnd the new MST with the updated weight. Your algorithm must run faster than
recomputing the MST from scratch, i.e., 0(|E|10g |V|) Give the running time of your procedure.

Attachments: