Rainbow Perfect and Near-Perfect Matchings in Complete Graphs with Edges Colored by Circular Distance.
Shuhei SaitoWei WuNaoki MatsumotoPublished in: CoRR (2020)
Keyphrases
- directed graph
- weighted graph
- spanning tree
- undirected graph
- real world graphs
- edge weights
- distance measure
- distance function
- hough transform
- edge detector
- similarity measure
- graph databases
- graph clustering
- maximum cardinality
- euclidean distance
- high dimensional
- social networks
- directed edges
- graph theoretic
- graph model
- graph theory
- distance transform
- graph matching