Login / Signup
Decomposing highly edge-connected graphs into paths of any given length.
Fábio Botler
Guilherme Oliveira Mota
M. T. I. Oshiro
Yoshiko Wakabayashi
Published in:
J. Comb. Theory, Ser. B (2017)
Keyphrases
</>
connected graphs
disjoint paths
path length
edge detection
edge information
shortest path
edge detector
fixed length
total length
line segments
closed form
databases
website
undirected graph
information systems
computer vision
edge pixels
straight line segments
minimum length
genetic algorithm
information retrieval