


default search action
"On the Exact & Approximate Complexity of the Strongly Connected ..."
Kevin Kurien Alex, Rajesh Chitnis, Alex Tempest (2025)
- Kevin Kurien Alex

, Rajesh Chitnis
, Alex Tempest:
On the Exact & Approximate Complexity of the Strongly Connected Steiner Subgraph Problem on Two Terminals with Demands. FCT 2025: 30-44

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID













