Could you give me a reference on the polynomial nature of this problem?
The way I understand max-flow problems, what you are asking for does not have a unique solution. The amount of flow will always be the same, but how much flow is found on which edges differs between algorithms. The obtained list of integer flows will therefore differ depending on how you obtained the total flow solution and how you extract the integer flows from it.
The solution of the problem I described is described in my submitted paper: https://www.researchgate.net/publication/322714014_Estimating_Flow_Rates_thr...
Please, let me know if you need further assistance. All the best,
________________________________________ From: graph-tool [firstname.lastname@example.org] on behalf of Percy [email@example.com] Sent: Tuesday, May 29, 2018 9:22 To: firstname.lastname@example.org Subject: Re: [graph-tool] FW: Graphtool: Finding the paths that the maximum flow algorithm produces
I encountered the same problem as you described in this issue. Generally, I would like to list all the integer flows in a single-source-single target maximal flow problem. According to the integer max flow theorem, I think the search should be polynomial. Nonetheless, I am not sure how to do it using graph-tool although it is fast and efficient. Could you please share some intuitive ideas to ? I am very appreciate your kindness.
-- Sent from: http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/ _______________________________________________ graph-tool mailing list email@example.com https://lists.skewed.de/mailman/listinfo/graph-tool