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 ...
Distributed algorithms for graph optimisation seek to solve combinatorial problems—such as covering, colouring, matching and domination—through local computation and limited communication. Each node ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results