A new upper bound on the acyclic chromatic indices of planar graphs.
Weifan WangQiaojun ShuYiqiao WangPublished in: Eur. J. Comb. (2013)
Keyphrases
- planar graphs
- upper bound
- lower bound
- partition function
- np hard
- color images
- branch and bound
- lower and upper bounds
- upper and lower bounds
- worst case
- np complete
- branch and bound algorithm
- minimum weight
- approximate inference
- higher order
- expectation maximization
- social networks
- knapsack problem
- weighted graph
- optimal solution