[Feature] Min-cut / Max-flow

vasia / gelly-streaming

An experimental Graph Streaming API for Apache Flink

Apache License 2.0

140 stars 44 forks source link

[Feature] Min-cut / Max-flow #28

Open drfloob opened 8 years ago

drfloob commented 8 years ago

Potential implementations:

A Distributed Mincut/Maxflow Algorithm Combining Path Augmentation and Push-Relabel
A distributed algorithm for min-max tree and max-min cut problems in communication networks

vasia commented 8 years ago

Hi @drfloob, thanks for opening this issue. Are the proposed algorithms single-pass and streaming? Or can they somehow be extended to work in the gelly-stream model?