3 papers
cs.DS2026
Query Complexity of Densest Sub(hyper)graph Problems
Sinan G. Aksoy, Eli Friedman, Nate Veldt +1
Rubinstein et al. introduce the study of connectivity and minimum cut problems in the cut query model, where an algorithm can only access the edges of a graph through CUT queries.…
cs.DS2026
Efficient Algorithms for Interdicting Facilities in Trees and Bounded Treewidth Graphs
Ali Abbasi, Eli Friedman, Leana Golubchik +2
Given a graph of nodes partitioned into facilities and customers, the -edge interdiction covering problem (REIC) is to remove up to edges so as to maximize the total…
cs.DS2026
An Evaluation of Vertex Elimination Strategies for Algorithmic Differentiation
Alex Crane, Pål Grønås Drange, Eli Friedman +6
The algorithmic differentiation (AD) of mathematical functions can be interpreted as a sequence of vertex eliminations in an underlying directed acyclic graph. The problem of deter…