Hi there,
I wonder how I can produce nontrivial edge cuts in a graph. An edge cut is trivial is all its edges are incident with one vertex.
The commands edge_cut and edge_connectivity tend to produce trivial cuts, even if nontrivial ones exist.
I look forward to your answer.
Regards, Guillermo
You might have more chance by using the 'LP' algorithm that does not take care of the geometry of the graph (but we need your actual graph to check).
Another trick would be to add a very small amount of positive weight to the edges adjacent to the source and sink vertices ("very small" means that the ordering between two unequal cuts will not be modified, but the ordering between trivial cuts and other cuts with the same value will change).
Hi @tmontell,
Thank you for your comments. But I need to process a large number of graphs, and so this is impractical.
Regards, Guillermo
Asked: 3 years ago
Seen: 278 times
Last updated: Aug 15 '21
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.
