3 citations · 4 across the 3 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.LO2018
Reachability and Distances under Multiple Changes
Samir Datta, Anish Mukherjee, Nils Vortmeier +1
Recently it was shown that the transitive closure of a directed graph can be updated using first-order formulas after insertions and deletions of single edges in the dynamic descri…
cs.DS2018
Shortest -Disjoint Paths via Determinants
Samir Datta, Siddharth Iyer, Raghav Kulkarni +1
The well-known -disjoint path problem (-DPP) asks for pairwise vertex-disjoint paths between specified pairs of vertices in a given graph, if they exist. The…