activity
20172026
most citedConditional Lower Bound for Subgraph Isomorphism with a Tree Pattern

3 citations · 8 across the 9 of their papers we have counts for

collaborators
Showing 2019Show all

1 paper · 1 filter

cs.DS2019★ 1 cited

New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs

Amir Abboud, Robert Krauthgamer, Ohad Trabelsi

We investigate the time-complexity of the All-Pairs Max-Flow problem: Given a graph with nodes and edges, compute for all pairs of nodes the maximum-flow value between them…