Minimum Steiner tree problem is NP complete problem.
图着色问题是著名的NP-完全问题。
It is proved that the problem of constructing an optimal Eectilinear Steiner Tree (RST) is NP-complete.
构造最优化的直角斯坦纳树(rst)是一个NP完全问题。
At first, this thesis introduces the VLSI physical design process, based on this leads to the rectilinear Steiner tree problem.
本文首先介绍了超大规模集成电路的物理设计流程，在此基础上引出直角斯坦纳树问题。
应用推荐