graph-data-science icon indicating copy to clipboard operation
graph-data-science copied to clipboard

Published 20 hours ago • verified publisher icon neo4j

Support computations of vertex (and edge) connectivity of graph along with the vertex-(edge-) disjoint paths (Menger's theorem))

Open lavkan opened this issue 3 years ago • 2 comments
trafficstars

Is your feature request related to a problem? Please describe. For a given pair of nodes (or node sets), I am trying to find the largest number of node disjoint paths between them. This is equal to the size of the min cut size that separates the two node (sets) - Menger's theorem https://en.wikipedia.org/wiki/Menger%27s_theorem

Describe the solution you would like

lavkan avatar May 22 '22 17:05 lavkan

Hi @lavkan, Thank you for this feature request. We have added it to our roadmap. We don't know when we'll be able to pick it up, but we'll keep you posted. Adam

adamnsch avatar May 23 '22 13:05 adamnsch

Hi @adamnsch, Thanks for the response. I posted this feature request here to see if anyone has attempted these algorithms either in GDS or with PregelAPI.

lavkan avatar May 23 '22 13:05 lavkan