436 views
1 votes
1 votes
Describe the subproblem graph for matrix-chain multiplication with an input chain of length n. How many vertices does it have? How many edges does it have, and which edges are they?

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
anjali007 asked Nov 19, 2018
232 views
Is the function (log n)! polynomially bounded? and Is (log log n)! polynomially bounded??
0 votes
0 votes
0 answers
3
Upasana singh asked Nov 7, 2017
150 views
Show that the worst case running time of heap sort is Ω(nlogn).