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 ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results