← Back to all news
arXiv Computer Vision By Christian M{\o}ller Mikkelstrup, Anders Bjorholm Dahl, Philip Bille, Vedrana Andersen Dahl, Inge Li G{\o}rtz

Fast and Compact Graph Cuts for the Boykov-Kolmogorov Algorithm

Read the original on arXiv Computer Vision →

The paper revisits the Boykov‑Kolmogorov (BK) algorithm for computing minimum s‑t cuts in graphs, improving its theoretical time complexity to O(mn|C|). It introduces a faster variant, the fast BK (fBK) algorithm, with complexity O(m|C|), and proposes a compact graph representation enabling the algorithms to handle graphs with up to 10^9 vertices and 10^10 edges on a 128 GB machine. Experiments show that the compact BK implementation (cBK) outperforms other BK variants, underscoring the value of memory‑efficient designs.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Computer Vision.

Related stories

arXiv Machine Learning
Aug 27

Optimal Time Complexity Algorithms for Computing General Random Walk Graph Kernels on Sparse Graphs

The paper introduces linear‑time randomized algorithms for unbiased approximation of general random walk kernels (RWKs) on sparse graphs, covering both labelled and unlabelled cases. By sampling dependent random walks and constructing novel graph embeddings in ρ^d, the method avoids building the direct product graph, enabling scaling to massive datasets that cannot fit on a single machine. The authors provide exponential concentration bounds for the estimator’s sharpness and demonstrate up to 27× speed‑ups and 128× larger graph handling compared to previous cubic‑time approaches.

By Krzysztof Choromanski, Isaac Reid, Arijit Sehanobish, Avinava Dubey
rag
More like this →
arXiv Machine Learning
Oct 19

Peak-Memory Schedules You Can Trust: Exact Realization, Certified Optimality, and the Limits of Recomputation for Inference

The paper presents a method for reliably scheduling operator execution in real‑time inference on small devices, achieving exact peak‑memory predictions and certified optimality. By profiling the generated program and modeling its memory usage, the authors can permute statements to match the modeled peak, guaranteeing bitwise‑identical results on CPUs and characterizing GPU limitations. They also provide efficient lower‑bound traps and analyze selective recomputation, showing it is NP‑hard in general but can reduce peak memory on certain architectures.

By Ivan Fomin, Ivan Koryabkin, Boris Sheludko
More like this →