0
$\begingroup$

How to use a $\Delta +1$ vertex coloring to find a maximal matching in a distributed graph.

$\endgroup$
  • $\begingroup$ What do you think? $\endgroup$ – Yuval Filmus Feb 10 at 4:35

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.