Removable edges in a k-connected graph and a construction method for k-connected graphs.

Jianji Su Xiaofeng Guo Liqiong Xu

Published in: Discret. Math. (2009)

Keyphrases

dynamic programming
detection method
computational complexity
high accuracy
similarity measure
objective function
high precision
cost function
computational cost
random walk
connected graphs
image processing
graph matching
graph cuts
support vector machine
significant improvement
pairwise
image sequences