In this paper the capacity of tree-flower in Edmonds theorem of graph theory is extended to minimum covering points and a computing formula of minimum covering points for non-dual graph is introduced.

  • 文中把图论里Edmonds定理的树花容量扩展为最小复盖点,并得到了计算非偶图最小复盖点数的公式。

  • 互联网摘选 2025-01-20 13:02:39

    • 相关例句
    精确
    • 模糊
    • 词首
    • 词尾
    • 词义
    • 例句