why dont we run Dp algorithm on TP , reduce the graph ( say take only the failing nodes ) and run the dp algorithm on the rest of the graph to solve the issue ? can we do this if not why ? I am also interested in knowing how you guys come up with constrains ? where do u get the test pattern is it provided or else try possible combinations ?
why dont we run Dp algorithm on TP , reduce the graph ( say take only the failing nodes ) and run the dp algorithm on the rest of the graph to solve the issue ? can we do this if not why ?
I am also interested in knowing how you guys come up with constrains ? where do u get the test pattern is it provided or else try possible combinations ?
hi avinash i need help from you a clear cut explanation on DPT and TPT...will you give me your email I'd....