Login / Signup
Sufficient conditions for graphs to be lambda'-optimal, super-edge-connected, and maximally edge-connected.
Angelika Hellwig
Lutz Volkmann
Published in:
J. Graph Theory (2005)
Keyphrases
</>
sufficient conditions
weighted graph
fixed point
efficiently computable
edge detection
connected components
undirected graph
optimal solution
exponential stability
dynamic programming
edge weights
asymptotic stability
neural network
image segmentation