A computational complexity comparative study of graph tessellation problems

Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Franklin L. Marquezino, Renato Portugal, Daniel Posner. A computational complexity comparative study of graph tessellation problems. Theoretical Computer Science, 858:81-89, 2021. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.