38 citations · 53 across the 13 of their papers we have counts for
3 papers · 2 filters
A Simple Subquadratic Cut Query Protocol for Directed Reachability
Henry Fleischmann, Sagnik Mukhopadhyay, Swagato Sanyal
We study -- reachability in an unweighted directed graph on vertices, accessed through a directed cut oracle: given , the oracle returns the number of edges…
Bipartite Matching with Few Rounds of Demand Queries
Shravan Mehra, Sagnik Mukhopadhyay, Vihan Shah
We study the randomised and deterministic demand-query complexity of approximate bipartite matching with few query rounds. The demand-query model, introduced in [Blumrosen and Nisa…
The Power of the Score Sequence of a Tournament
Prantar Ghosh, Sahil Kuchlous, Shravan Mehra +1
What problems can one solve on a tournament if only its score sequence is known? Tournaments are oriented complete graphs that form an extensively-studied class of directed graphs…