Strong edge-colorings of sparse graphs with large maximum degree.
Ilkyoo ChoiJaehoon KimAlexandr V. KostochkaAndré RaspaudPublished in: Eur. J. Comb. (2018)
Keyphrases
- weighted graph
- undirected graph
- edge detection
- densely connected
- random graphs
- edge weights
- gaussian graphical models
- graph theoretic
- edge information
- minimum spanning trees
- sparse data
- sparse representation
- high dimensional
- low degree
- graph theory
- graph databases
- graph matching
- graph partitioning
- compressed sensing
- directed graph
- multiscale
- directed acyclic
- shortest path
- vertex set
- edge detector
- sparse coding
- image segmentation
- graph model
- bipartite graph