Upper bounds for adjacent vertex-distinguishing edge coloring.
Junlei ZhuYuehua BuYun DaiPublished in: J. Comb. Optim. (2018)
Keyphrases
- upper bound
- lower bound
- undirected graph
- vertex set
- upper and lower bounds
- edge detection
- worst case
- edge information
- lower and upper bounds
- directed graph
- edge detector
- edge weights
- branch and bound
- branch and bound algorithm
- multiple scales
- tight upper and lower bounds
- tight bounds
- efficiently computable
- generalization error
- weighted graph
- error probability
- multiscale
- hough transform
- strongly connected
- sample size
- permutation flowshop
- optimal solution
- upper bounding