On strong edge-coloring of graphs with maximum degree 4.
Jian-Bo LvXiangwen LiGexin YuPublished in: Discret. Appl. Math. (2018)
Keyphrases
- weighted graph
- undirected graph
- low degree
- random graphs
- edge detection
- graph theoretic
- minimum spanning trees
- directed graph
- structured objects
- edge weights
- maximum number
- data sets
- graph partitioning
- edge information
- database
- graph structure
- graph matching
- minimum spanning tree
- neural network
- data structure
- degree distribution
- strongly connected
- graph kernels
- pattern recognition
- graph clustering
- graph model
- multiple scales
- evolutionary algorithm
- multi objective
- bipartite graph
- graph databases
- graph mining