搜索结果: 1-1 共查到“理学 Planarity Criterion”相关记录1条 . 查询时间(0.045 秒)
A graph G is called "minimalizable" if a diagram with minimal crossing number can be obtained from an arbitrary diagram of G by crossing changes. If, furthermore, the minimal diagram is unique up to ...