Fast algorithms for even/odd minimum cuts and generalizations

DOI10.1007/3-540-45253-2_9MaRDI QIDQ2753925zbMATH OpenFDO

Authors Ottilia Fülöp, András A. Benczúr

Publication date 18 December 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45253-2_9

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 7759280
• scientific article; zbMATH DE number 1256719
• A fast algorithm for the generalized parametric minimum cut problem and applications
• Faster algorithms for all-pairs bounded min-cuts
• A faster parametric minimum-cut algorithm
• Deterministic mincut in almost-linear time
• Approximation algorithms for minimum \(K\)-cut
• Fast and Deterministic Approximations for k-Cut.
• Fast and deterministic approximations for \(k\)-cut
• Efficient algorithms for the minimum range cut problems

Cited in

(7)

• A simple minimum \(T\)-cut algorithm
• Special minimum cuts in directed graphs: note.
• Odd Minimum Cut Sets and b-Matchings Revisited
• scientific article; zbMATH DE number 2188469 (Why is no real title available?)
• Massively Parallel Algorithms for Minimum Cut
• scientific article; zbMATH DE number 7765379 (Why is no real title available?)
• Constant-factor approximation algorithms for parity-constrained facility location and \(k\)-center

This page was built for publication: Fast algorithms for even/odd minimum cuts and generalizations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2753925)