scientific article; zbMATH DE number 7413500
From MaRDI portal
Publication:5158499
DOI10.4086/toc.2021.v017a005OpenAlexW3199087386MaRDI QIDQ5158499
Robert Krauthgamer, Amir Abboud, Ohad Trabelsi
Publication date: 25 October 2021
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.01412
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Certifying algorithms
- Flow trees for vertex-capacitated networks
- Multi-terminal maximum flows in node-capacitated networks
- A matroid approach to finding edge connectivity and packing arborescences
- A framework for the verification of certifying computations
- A new algorithm for optimal 2-constraint satisfaction and its implications
- Cut Tree Algorithms: An Experimental Study
- Nondeterministic Extensions of the Strong Exponential Time Hypothesis and Consequences for Non-reducibility
- Graph Connectivities, Network Coding, and Expander Graphs
- All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs
- Maximal Flow Through a Network
- Synthesis of a Communication Net
- Very Simple Methods for All Pairs Network Flow Analysis
- An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs
- Multi-Terminal Network Flows
- All-Pairs Min-Cut in Sparse Networks
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture
- Conditional Lower Bounds for All-Pairs Max-Flow
- Preserving and Increasing Local Edge-Connectivity in Mixed Graphs
- Planar Graph Perfect Matching Is in NC
- Faster energy maximization for faster maximum flow
- More consequences of falsifying SETH and the orthogonal vectors conjecture
- On the complexity of \(k\)-SAT
- Subcubic algorithms for Gomory–Hu tree in unweighted graphs
- Minimum cost flows, MDPs, and ℓ 1 -regression in nearly linear time for dense instances
This page was built for publication:
