查找最小（边缘）重量（边缘）的同构子图
我有一个无方向的图形 g ，具有边缘权重，想找到与其他给定的图形 h 异构的子图形，以便在所有边缘权重的总和中子图最小。 h 也是无方向性的，但没有任何边缘权重，可以断开连接。
- 是否有算法可以找到最小的子图？
- 如果 g 是一个完全连接的图表，是否可以简化问题？
- 后续：如果 h 也具有边缘权重，目标是最大程度地减少 f的总和（w h ，w >）对于 h 中边缘的重量的某些功能 f 及其在 g 的子图中的相应边缘
I have an undirected graph G with edge weights and want to find a sub-graph that is isomorph to some other given graph H, such that the sum of all edge weights in the sub-graph is minimal. H is undirected as well but doesn't have any edge weights and can be disconnected.
- Is there an algorithm to find the minimal sub-graph?
- If G is a fully connected graph, does that simplify the problem?
- Follow-up: what if H also has edge weights and the goal is to minimize the sum of f(wH, wG) for some function f of the weights of an edge in H and its corresponding edge in the sub-graph of G
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论