Find centralized, trusted content and collaborate around the technologies you use most.
Teams
Q&A for work
Connect and share knowledge within a single location that is structured and easy to search.
假设我有一个包含 N 个节点的图,并且每对节点都有一个与之关联的权重。我想将此图拆分为 n 个较小的图以减少整体权重。
您正在搜索的内容称为加权最大切割。
移除权重最高的 k-1 条边。