One upper bound on the D(3)-vertex-distinguishing edge- chromatic numbers of graphs.
Jing-jing TianFang'an DengPublished in: FSKD (2010)
Keyphrases
- upper bound
- undirected graph
- edge weights
- vertex set
- lower bound
- weighted graph
- directed graph
- worst case
- approximation algorithms
- random graphs
- labeled graphs
- connected components
- spanning tree
- minimum cost
- minimum weight
- graph structure
- attributed graphs
- strongly connected
- lower and upper bounds
- minimum spanning trees
- color images
- bipartite graph
- directed acyclic graph
- error probability
- branch and bound algorithm
- branch and bound
- complex networks
- connected subgraphs
- hamiltonian cycle
- np hard
- maximum cardinality
- average degree
- minimum spanning tree
- graph partitioning
- multiscale
- graph structures
- graph clustering
- image processing
- constant factor
- graph kernels
- human perception
- shortest path
- special case
- neural network