An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph.
Lianzhu ZhangWeifan WangKo-Wei LihPublished in: Discret. Appl. Math. (2014)
Keyphrases
- subgraph isomorphism
- upper bound
- labeled graphs
- graph matching
- graph databases
- weighted graph
- lower bound
- graph mining
- index structure
- minimum weight
- worst case
- branch and bound algorithm
- attributed graphs
- lower and upper bounds
- edge weights
- color images
- b tree
- branch and bound
- multi dimensional
- undirected graph
- graph partitioning
- graph data
- database
- error probability
- spanning tree
- xml documents
- database systems