Given an undirected graph with weights on the vertices, the maximum weight clique problem is to find a subset of mutually adjacent vertices ( i.e., a clique) having the largest total weight.

  • 给定顶点赋权的无向图,图的最大权团问题是寻找每个顶点都相邻的顶点子集(团)具有最大权。

  • 互联网摘选 2025-01-19 23:57:11

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