A GNN learns edge probabilities to prioritize paths in Ford-Fulkerson, reducing augmentations while keeping max-flow/min-cut optimality.
International journal of computer vision , volume=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Graph Neural Network-Informed Predictive Flows for Faster Ford-Fulkerson and PAC-Learnability
A GNN learns edge probabilities to prioritize paths in Ford-Fulkerson, reducing augmentations while keeping max-flow/min-cut optimality.