Login / Signup
Decompositions of edge-colored infinite complete graphs into monochromatic paths.
Márton Elekes
Dániel T. Soukup
Lajos Soukup
Zoltán Szentmiklóssy
Published in:
Discret. Math. (2017)
Keyphrases
</>
weighted graph
disjoint paths
undirected graph
shortest path
directed graph
minimum spanning trees
edge detection
edge information
edge weights
neural network
spanning tree
graph mining
adjacency graph
graph data
graph theoretic
edge map
directed acyclic graph
graph theory
random walk
color images
image segmentation