Cover Image

Fast and Compact Graph Cuts for the Boykov-Kolmogorov Algorithm

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Mikkelstrup, Christian Møller, Dahl, Anders Bjorholm, Bille, Philip, Dahl, Vedrana Andersen, Gørtz, Inge Li
Format:	Preprint
Published:	2026
Subjects:	Computer Vision and Pattern Recognition Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fast Practical Compression of Deterministic Finite Automata
by: Bille, Philip, et al.
Published: (2023)

Succinct Data Structures for Segments
by: Bille, Philip, et al.
Published: (2024)

Improved Extended Regular Expression Matching
by: Bille, Philip, et al.
Published: (2025)

String Indexing with Compressed Patterns
by: Bille, Philip, et al.
Published: (2019)

Dynamic Range Minimum Queries on the Ultra-Wide Word RAM
by: Bille, Philip, et al.
Published: (2024)

Compressed Dictionary Matching on Run-Length Encoded Strings
by: Bille, Philip, et al.
Published: (2025)

Differentially Private Substring and Document Counting with Near-Optimal Error
by: Bernardini, Giulia, et al.
Published: (2024)

String Indexing for Top-$k$ Close Consecutive Occurrences
by: Bille, Philip, et al.
Published: (2020)

Gapped String Indexing in Subquadratic Space and Sublinear Query Time
by: Bille, Philip, et al.
Published: (2022)

The Fine-Grained Complexity of Episode Matching
by: Bille, Philip, et al.
Published: (2021)

Diffusion Based Ambiguous Image Segmentation
by: Christensen, Jakob Lønborg, et al.
Published: (2025)

Towards Agnostic and Holistic Universal Image Segmentation with Bit Diffusion
by: Christensen, Jakob Lønborg, et al.
Published: (2026)

Fast Isotropic Median Filtering
by: Weiss, Ben
Published: (2025)

Rethinking Uncertainty Quantification and Entanglement in Image Segmentation
by: Christensen, Jakob Lønborg, et al.
Published: (2026)

Hadamard Row-Wise Generation Algorithm
by: Monroy, Brayan, et al.
Published: (2024)

A Simple and Fast Algorithm for Fair Cuts
by: Li, Jason, et al.
Published: (2024)

A Joint Sparse Self-Representation Learning Method for Multiview Clustering
by: Jia, Mengxue, et al.
Published: (2025)

Group Testing for Accurate and Efficient Range-Based Near Neighbor Search for Plagiarism Detection
by: Shah, Harsh, et al.
Published: (2023)

An Optimal Algorithm for Stochastic Vertex Cover
by: Brand, Jan van den, et al.
Published: (2026)

A Unified Framework for Integer Programming Formulation of Graph Matching Problems
by: Alidaee, Bahram, et al.
Published: (2024)

BugNIST -- a Large Volumetric Dataset for Object Detection under Domain Shift
by: Jensen, Patrick Møller, et al.
Published: (2023)

Size-constrained Weighted Ancestors with Applications
by: Bille, Philip, et al.
Published: (2023)

How many users have been here for a long time? Efficient solutions for counting long aggregated visits
by: Afshani, Peyman, et al.
Published: (2026)

VoDaSuRe: A Large-Scale Dataset Revealing Domain Shift in Volumetric Super-Resolution
by: Høeg, August Leander, et al.
Published: (2026)

Fast Algorithms for Graph Arboricity and Related Problems
by: Cen, Ruoxu, et al.
Published: (2025)

Learning Tree-Structured Composition of Data Augmentation
by: Li, Dongyue, et al.
Published: (2024)

Cut-Query Algorithms with Few Rounds
by: Kenneth-Mordoch, Yotam, et al.
Published: (2025)

Sketching Cuts in Graphs and Hypergraphs
by: Kogan, Dmitry, et al.
Published: (2014)

Faster Algorithms for Graph Monopolarity
by: Philip, Geevarghese, et al.
Published: (2024)

Parallel Algorithm For Finding The Minimum s/t Cut in a Structured 3-Dimensional Proper Order Graph
by: Chandramouli, Shridharan
Published: (2026)

Fast Parallel Algorithms for Submodular $p$-Superseparable Maximization
by: Cervenjak, Philip, et al.
Published: (2023)

Probabilistic Kernel Function for Fast Angle Testing
by: Lu, Kejing, et al.
Published: (2025)

Streaming Algorithms via Local Algorithms for Maximum Directed Cut
by: Saxena, Raghuvansh R., et al.
Published: (2024)

Matching (Multi)Cut: Algorithms, Complexity, and Enumeration
by: Gomes, Guilherme C. M., et al.
Published: (2024)

Local Max-Cut on Sparse Graphs
by: Schwartzman, Gregory
Published: (2023)

Fast and Compact Sketch-Based Dynamic Connectivity
by: De Man, Quinten, et al.
Published: (2025)

Engineering Weighted Connectivity Augmentation Algorithms
by: Faraj, Marcelo Fonseca, et al.
Published: (2024)

Streaming and Massively Parallel Algorithms for Euclidean Max-Cut
by: Menand, Nicolas, et al.
Published: (2025)

Designing Compact ILPs via Fast Witness Verification
by: Włodarczyk, Michał
Published: (2025)

A Fast Approximation Algorithm for the Minimum Balanced Vertex Separator in a Graph
by: Kolmogorov, Vladimir, et al.
Published: (2026)