Vertex Colouring Edge Weightings: a Logarithmic Upper Bound on Weight-Choosability.
Kasper Szabo LyngsieLiang ZhongPublished in: Electron. J. Comb. (2021)
Keyphrases
- upper bound
- edge weights
- worst case
- lower bound
- undirected graph
- weighted graph
- vertex set
- upper and lower bounds
- lower and upper bounds
- bipartite graph
- branch and bound
- directed graph
- shortest path
- minimum weight
- error probability
- edge detection
- edge information
- spanning tree
- sample complexity
- regret bounds
- generalization error
- tf idf
- real time
- edge points
- single item
- branch and bound algorithm
- objective function
- genetic algorithm
- neural network