Skip to main content

1 Result(s)

within Computer Science Remove this filter Symbolic and Algebraic Manipulation Remove this filter Pranabendu Misra Remove this filter Chapter Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    An ETH-Tight Algorithm for Bidirected Steiner Connectivity

    In the Strongly Connected Steiner Subgraph problem, we are given an n-vertex digraph D, a weight function \(w:A(D)\mapsto {\mathbb {R}}^+\) ...

    Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan… in Algorithms and Data Structures (2023)