Finding all perfect matchings in a given bipartite graph has importantapplications to the global routing and channel ordering for VLSI building block layout.

• 求给定偶图的所有完备匹配问题在LSI/VLSI的布图设计方面有着重要的应用。