Login / Signup
Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions).
Rajesh Chitnis
Andreas Emil Feldmann
MohammadTaghi Hajiaghayi
Dániel Marx
Published in:
CoRR (2019)
Keyphrases
</>
fixed number
tight bounds
strongly connected
upper bound
directed graph
optimum path forest
finite number
default logic
graph properties
maximum weight
special case
partial ordering
lower bound
graph databases
random walk
np hard
undirected graph
graph mining
markov chain
worst case