Bounds and complexity results for strong edge colouring of subcubic graphs.
Hervé HocquardPascal OchemPetru ValicovPublished in: Electron. Notes Discret. Math. (2011)
Keyphrases
- worst case
- weighted graph
- edge detection
- lower bound
- undirected graph
- upper bound
- edge weights
- minimum spanning trees
- computational cost
- edge detector
- polynomial time complexity
- error tolerance
- graph kernels
- graph databases
- edge information
- space complexity
- neural network
- error bounds
- search algorithm
- objective function
- high level
- image processing