Polynomial Time Complexity of Edge Colouring Graphs with Bounded Colour Classes.

Romeo Rizzi David Cariolaro

Published in: Algorithmica (2014)

Keyphrases

polynomial time complexity
np complete
weighted graph
bounded treewidth
undirected graph
edge information
computational complexity
edge detection
colour images
bounded degree
edge detector
algebraic structures
multiscale
graph theory
connected components
higher order
least squares
image analysis