Optimal Adjacent Vertex-Distinguishing Edge-Colorings of Circulant Graphs.
Sylvain GravierHippolyte SignargoutSouad SlimaniPublished in: CoRR (2020)
Keyphrases
- undirected graph
- weighted graph
- edge weights
- vertex set
- directed graph
- minimum spanning trees
- least squares
- minimum cost
- optimal solution
- dynamic programming
- graph matching
- edge information
- spanning tree
- edge detection
- graph clustering
- graph coloring
- minimum weight
- attributed graphs
- multiscale
- edge detector
- closed form
- worst case
- labeled graphs
- adjacency graph