Search Results - Graph minimum-cut algorithm

Deterministic Minimum Cut in Poly-logarithmic Maximum Flows.

Authors: Li, Jason Panigrahi, Debmalya

Source: Journal of the ACM. Aug2025, Vol. 72 Issue 4, p1-18. 18p.

Subject Terms: UNDIRECTED graphs, GRAPH theory, DETERMINISTIC algorithms

High‐Speed Minimum Cut Approximation in Dense Graph Using Compacted Pruned Tree.

Authors: Ma, Ronghua Yao, Weibin

Source: Mathematical Methods in the Applied Sciences. Oct2025, Vol. 48 Issue 15, p14110-14120. 11p.

Subject Terms: *DENSE graphs, *GRAPH algorithms, *TREE pruning, *GRAPH theory, *OPTIMIZATION algorithms, *HEURISTIC

A Recursive Solution to the Global Maximum Minimum Cut Problem with a Fixed Sink.

Authors: Huang, Xiaoyao Quan, Shuo Wu, Jie

Source: Algorithms. Oct2025, Vol. 18 Issue 10, p665. 19p.

Subject Terms: *GRAPH theory, *ALGORITHMS, *NETWORK theory (Statistical physics), *SCALABILITY, *FLOW measurement

GCphase: an SNP phasing method using a graph partition and error correction algorithm

Authors: Junwei Luo Jiayi Wang Haixia Zhai et al.

Source: BMC Bioinformatics, Vol 25, Iss 1, Pp 1-14 (2024)

Subject Terms: Haplotype assembly, SNP phasing, Graph minimum-cut algorithm, Error correction, Computer applications to medicine. Medical informatics, R858-859.7, Biology (General), QH301-705.5

File Description: electronic resource

Relation: https://doaj.org/toc/1471-2105

Access URL: https://doaj.org/article/615f80da87744b40aefbb4b2fefe997c

Work-Optimal Parallel Minimum Cuts for Non-Sparse Graphs

Authors: López-Martínez, Andrés Mukhopadhyay, Sagnik Nanongkai, Danupon

Source: SPAA
Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures

Subject Terms: FOS: Computer and information sciences, Parallel algorithms, Computer Science - Data Structures and Algorithms, Minimum cut, 0202 electrical engineering, electronic engineering, information engineering, Orthogonal range searching, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, Graph algorithms, 01 natural sciences, Approximation algorithms

Access URL: http://arxiv.org/pdf/2102.06565
http://arxiv.org/abs/2102.06565
https://dl.acm.org/doi/pdf/10.1145/3409964.3461806
https://spaa.acm.org/program/#47
https://dblp.uni-trier.de/db/journals/corr/corr2102.html#abs-2102-06565
https://arxiv.org/pdf/2102.06565

Query Algorithms for Graph Connectivity and st-Minimum Cut

Authors: Auza, Arinta Primandini

Index Terms: Thesis

URL: http://hdl.handle.net/10453/171481
https://opus.lib.uts.edu.au/bitstream/10453/171481/1/thesis.pdf
https://opus.lib.uts.edu.au/bitstream/10453/171481/1/thesis.pdf

Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions

Authors: Bansal, Ishan Cheriyan, Joseph Grout, Logan et al.

Contributors: Bansal, Ishan Cheriyan, Joseph Grout, Logan et al.

Source: Algorithmica. 86:2575-2604

Subject Terms: FOS: Computer and information sciences, flexible graph connectivity, network design, 0211 other engineering and technologies, edge-connectivity of graphs, 0102 computer and information sciences, 02 engineering and technology, Small cuts, 01 natural sciences, Theory of computation → Approximation algorithms analysis, f-connectivity problem, primal-dual method, Edge-connectivity of graphs, Primal-dual method, Minimum cuts, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), approximation algorithms, Network design, minimum cuts, f-Connectivity problem, Approximation algorithms, Flexible Graph Connectivity, flexible Graph Connectivity, ddc:004, small cuts

File Description: application/pdf

Access URL: http://arxiv.org/abs/2209.11209
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.15
http://eprints.lse.ac.uk/123858/
http://eprints.lse.ac.uk/120005/

Minimum Cuts in Directed Graphs via Partial Sparsification

Authors: Cen, Ruoxu Li, Jason Nanongkai, Danupon et al.

Source: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science
FOCS
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)

Subject Terms: FOS: Computer and information sciences, Sparsification, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 01 natural sciences, Directed minimum cut

Access URL: http://arxiv.org/pdf/2111.08959
http://arxiv.org/abs/2111.08959
http://hdl.handle.net/21.11116/0000-000E-6CE3-9

Minimum Cuts in Surface Graphs

Authors: Chambers, Erin W. Erickson, Jeff Fox, Kyle et al.

Source: SIAM Journal on Computing. 52:156-195

Subject Terms: Computational Geometry (cs.CG), FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 01 natural sciences

Access URL: http://arxiv.org/abs/1910.04278

Deterministic Near-Linear Time Minimum Cut in Weighted Graphs

Authors: Henzinger, Monika Li, Jason Rao, Satish et al.

Source: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977912
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)

Subject Terms: Computer Science - Data Structures and Algorithms

Access URL: http://arxiv.org/abs/2401.05627

Graph Algorithms: Cuts, Flows, and Network Design (Dagstuhl Seminar 23422)

Authors: Li, Jason Panigrahi, Debmalya Sanita, Laura et al.

Contributors: Li, Jason Panigrahi, Debmalya Sanita, Laura et al.

Subject Terms: minimum cut, graph algorithm, network design, ddc:004, approximation, maximum flow

File Description: application/pdf

Access URL: https://drops.dagstuhl.de/entities/document/10.4230/DagRep.13.10.76

A sublinear query quantum algorithm for s-t minimum cut on dense simple graphs

Authors: Apers, Simon Auza, Arinta Lee, Troy

Subject Terms: FOS: Computer and information sciences, Quantum Physics, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, FOS: Physical sciences, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 0101 mathematics, Computational Complexity (cs.CC), Quantum Physics (quant-ph), 01 natural sciences

Access URL: http://arxiv.org/abs/2110.15587

Polyhedral approach to weighted connected matchings in general graphs

Authors: Phillippe Samer Phablo F.S. Moura

Source: Discrete Applied Mathematics

Subject Terms: G.4, FOS: Computer and information sciences, Combinatorial optimization, Induced connectivity, Discrete Mathematics (cs.DM), MINIMUM CUT-SETS, G.1.6, Mathematics, Applied, G.2.2, Polyhedral combinatorics, NP-COMPLETENESS, Computation Theory & Mathematics, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), 0102 Applied Mathematics, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, 4901 Applied mathematics, Data Structures and Algorithms (cs.DS), connected subgraphs, polyhedral combinatorics, integer programming, 0802 Computation Theory and Mathematics, 4613 Theory of computation, Science & Technology, Connected matchings, induced connectivity, 4601 Applied computing, Integer programming, 90C27, 90C57, 90C11, 68R10, Connected subgraphs, Physical Sciences, connected matchings, combinatorial optimization, Combinatorics (math.CO), Mathematics, Computer Science - Discrete Mathematics

File Description: application/xml; application/pdf

Access URL: http://arxiv.org/abs/2310.05733
https://hdl.handle.net/11250/3145882

A new—old algorithm for minimum‐cut and maximum‐flow in closure graphs: A new-old algorithm for minimum-cut and maximum-flow in closure graphs.

Authors: Dorit S. Hochbaum

Source: Networks. 37:171-193

Subject Terms: closure graph, sensitivity analysis, Graph theory (including graph drawing) in computer science, Graph algorithms (graph-theoretic aspects), minimum-cut, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Programming involving graphs or networks, 01 natural sciences, Lerchs-Grossmann algorithm, maximum flow

File Description: application/xml

Access URL: https://onlinelibrary.wiley.com/doi/10.1002/net.1012
https://dblp.uni-trier.de/db/journals/networks/networks37.html#Hochbaum01
https://doi.org/10.1002/net.1012
http://onlinelibrary.wiley.com/doi/10.1002/net.1012/full

A sublinear time quantum algorithm for s-t minimum cut on dense simple graphs

Authors: Apers, S Auza, A Lee, T

Index Terms: preprint

URL: http://hdl.handle.net/10453/155722

I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs

Authors: Alka Bhushan G. Sajith

Source: Lecture Notes in Computer Science ISBN: 9783319046563

Subject Terms: 4. Education, 0102 computer and information sciences, 0101 mathematics, 7. Clean energy, 01 natural sciences

Access URL: https://www.sciencedirect.com/science/article/pii/S0304397514008354
https://dblp.uni-trier.de/db/journals/tcs/tcs575.html#BhushanG15
https://dblp.uni-trier.de/db/conf/walcom/walcom2014.html#BhushanG14
https://rd.springer.com/chapter/10.1007/978-3-319-04657-0_19
https://link.springer.com/chapter/10.1007/978-3-319-04657-0_19

A Faster Algorithm for Finding the Minimum Cut in a Directed Graph: A faster algorithm for finding the minimum cut in a directed graph

Authors: Jack Jianxiu Hao James B. Orlin

Source: Journal of Algorithms. 17:424-446

Subject Terms: Graph theory (including graph drawing) in computer science, Analysis of algorithms and problem complexity, Deterministic network models in operations research, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, minimum capacity cut, directed network, Abstract computational complexity for mathematical programming problems, 01 natural sciences

File Description: application/xml

Access URL: https://zbmath.org/694903
https://doi.org/10.1006/jagm.1994.1043

Maximum-Flow and Minimum-Cut Sensitivity Oracles for Directed Graphs

Authors: Ahi, Mridul Choudhary, Keerti Pande, Shlok et al.

Subject Terms: Data Structures and Algorithms

Relation: http://arxiv.org/abs/2512.00153

Availability: http://arxiv.org/abs/2512.00153

Rethinking the implementation and application of the Benczur-Karger minimum cuts algorithm

Authors: Hanqin Gu

Source: International Journal of ADVANCED AND APPLIED SCIENCES. 11:57-62

Subject Terms: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Vertex Connectivity in Poly-logarithmic Max-Flows.

Authors: Li, Jason Nanongkai, Danupon Panigrahi, Debmalya et al.

Source: Journal of the ACM; Aug2025, Vol. 72 Issue 4, p1-34, 34p

Subject Terms: GRAPH connectivity, COMPUTATIONAL complexity, DIRECTED graphs, ALGORITHMS, UNDIRECTED graphs