Graph colouring, the assignment of colours to the vertices of a graph so that no two adjacent vertices share the same colour, represents a canonical NP-hard combinatorial optimisation problem with ...
This paper formalizes smooth curve coloring (i.e., curve identification) in the presence of curve intersections as an optimization problem, and investigates theoretically properties of its optimal ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results