2012 7th Colombian Computing Congress (CCC) , pages=

Complexity of Cayley distance, other general metrics on permutation groups , author= · 2012

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

browse 1 citing papers

representative citing papers

cs.LG · 2026-04-23 · unverdicted · novelty 5.0

A GNN learns edge probabilities to prioritize paths in Ford-Fulkerson, reducing augmentations while keeping max-flow/min-cut optimality.

Showing 1 of 1 citing paper.

Graph Neural Network-Informed Predictive Flows for Faster Ford-Fulkerson and PAC-Learnability cs.LG · 2026-04-23 · unverdicted · none · ref 8
A GNN learns edge probabilities to prioritize paths in Ford-Fulkerson, reducing augmentations while keeping max-flow/min-cut optimality.