Login / Signup
Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions).
Rajesh Hemant Chitnis
Andreas Emil Feldmann
Mohammad Taghi Hajiaghayi
Dániel Marx
Published in:
SIAM J. Comput. (2020)
Keyphrases
</>
fixed number
tight bounds
strongly connected
upper bound
directed graph
finite number
optimum path forest
graph properties
partial ordering
graph mining
undirected graph
reinforcement learning
random walk
dynamic programming
graph databases
worst case
np hard
identical parallel machines
color images
lower bound