Login / Signup
Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions).
Rajesh Hemant Chitnis
MohammadTaghi Hajiaghayi
Dániel Marx
Published in:
SODA (2014)
Keyphrases
</>
fixed number
tight bounds
strongly connected
upper bound
directed graph
optimum path forest
finite number
partial ordering
graph properties
graph mining
undirected graph
default logic
search space
lower bound
ground plane
graph databases
feature space
graph structure
probabilistic model