Login / Signup
Optimal Augmentation to Make a Graph k-Edge-Connected and Triconnected.
Toshimasa Ishii
Hiroshi Nagamochi
Toshihide Ibaraki
Published in:
SODA (1998)
Keyphrases
</>
weighted graph
connected components
dynamic programming
neighborhood graph
graph structure
undirected graph
edge weights
graph theory
disjoint paths
image processing
graph theoretic
optimal design
edge information
directed graph
random walk
worst case
data points
reinforcement learning