Login / Signup
Better performance bounds for finding the smallest k-edge connected spanning subgraph of a multigraph.
Harold N. Gabow
Published in:
SODA (2003)
Keyphrases
</>
upper and lower bounds
upper bound
data sets
search space
edge information
strongly connected
lower bound
special case
edge detection
database
scale space
connected components
edge detector
lower and upper bounds