Anthony Wirth

activity

20212024

most citedLower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths

1 citations · 1 across the 4 of their papers we have counts for

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2024★ 1 cited

Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths

Rajesh Chitnis, Samuel Thomas, Anthony Wirth

Given a graph $G = (V, E)$ and a set $T = {(s_{i}, t_{i}) : 1 \leq i \leq k} \subseteq V \times V$ of $k$ pairs, the $k$ -vertex-disjoint-paths (resp. $k$ -edge-disjoint-paths) problem asks t…

cs.DS2024

Online Computation of String Net Frequency

Peaker Guo, Seeun William Umboh, Anthony Wirth +1

The net frequency (NF) of a string, of length $m$ , in a text, of length $n$ , is the number of occurrences of the string in the text with unique left and right extensions. Recently,…

cs.DS2023

Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs

Xiuge Chen, Rajesh Chitnis, Patrick Eades +1

In this paper, we design sub-linear space streaming algorithms for estimating three fundamental parameters -- maximum independent set, minimum dominating set and maximum matching -…