Combinatorial optimisation in graph theory concerns the study and design of algorithms to find optimal or near-optimal discrete structures within graphs. Classical problems include shortest-path ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results