2 citations · 4 across the 7 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.DS2023
An Enumerative Perspective on Connectivity
Shyan Akmal
Connectivity (or equivalently, unweighted maximum flow) is an important measure in graph theory and combinatorial optimization. Given a graph with vertices and , the con…
cs.DS2023
Faster Detours in Undirected Graphs
Shyan Akmal, Virginia Vassilevska Williams, Ryan Williams +1
The -Detour problem is a basic path-finding problem: given a graph on vertices, with specified nodes and , and a positive integer , the goal is to determine if…
cs.DS2023
An Efficient Algorithm for All-Pairs Bounded Edge Connectivity
Shyan Akmal, Ce Jin
Our work concerns algorithms for an unweighted variant of Maximum Flow. In the All-Pairs Connectivity (APC) problem, we are given a graph on vertices and edges, and are…