Login / Signup
Two paths joining given vertices in (2k+1)-edge-connected graphs.
Haruko Okamura
Published in:
Ars Comb. (2005)
Keyphrases
</>
connected graphs
disjoint paths
weighted graph
undirected graph
shortest path
edge information
closed form
edge detection
markov random field
edge weights
case study
vertex set
database
data sets
edge detector
multiple scales