Hello, I am looking for references to an algorithm to find a triangulated subgraph G'=(V',E') on an undirected graph G = (V,E) such that | E - E'| is minimum. In a more general case edges are weighted, and the task is to find a decomposable subgraph of G by means of removing from G that set of edges such that the sum of its edges' weights is minimum. Thanks in advance for your help. Roberto Santana Roberto Santana ------------------------------------------------- Institute of Cybernetics, Mathematics and Physics Havana, Cuba
