scientific article; zbMATH DE number 7561500

DOI10.4230/LIPIcs.ICALP.2019.7MaRDI QIDQ5091155

Amir Abboud, Daniel Wolleb-Graf, Nikos Parotsidis, Przemysław Uznański, Loukas Georgiadis, Robert Krauthgamer, Giuseppe F. Italiano, Ohad Trabelsi

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1807.05803

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

directed graphsnetwork codingfine-grained complexity\(k\)-reachabilityall-pairs min-cut

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (1)

Improved Merlin-Arthur protocols for central problems in fine-grained complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of fixed parameter clique and dominating set
• Parameterized graph separation problems
• Minimum cost subpartitions in graphs
• Matrix multiplication via arithmetic progressions
• Efficient algorithms for clique problems
• An improved combinatorial algorithm for Boolean matrix multiplication
• Blocking unions of arborescences
• All-pairs shortest paths with real weights in \(O ( n^{3}/\log n )\) time
• Graph Connectivities, Network Coding, and Expander Graphs
• Powers of tensors and fast matrix multiplication
• An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs
• Multi-Terminal Network Flows
• All-Pairs Min-Cut in Sparse Networks
• If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser
• Matching Triangles and Basing Hardness on an Extremely Popular Conjecture
• Subcubic Equivalences Between Path, Matrix, and Triangle Problems
• Conditional Lower Bounds for All-Pairs Max-Flow
• All-Pairs 2-Reachability in O(n^w log n) Time
• Multiplying matrices faster than coppersmith-winograd
• Encyclopedia of Algorithms

This page was built for publication: