I want to divide a graph to subgraphs that each subgraph made from maximum 3 vertices and sum of weight of edges is minimized, the main graph is complete ( have all possible edges ), and edges are weighted. the main problem that i want to solve is finding close three threes points on a map.
I'm sure this problem is NP-Complete. It's called the minimum k-cut problem .
Try to take a look at this article . It talks about approximation algorithms to solve such problems.
The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.