A computational complexity comparative study of graph tessellation problems - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Alexandre Santiago de Abreu' in GoogleThis author has not been identified. Look up 'Luís Felipe I. Cunha' in GoogleThis author has not been identified. Look up 'Celina M. H. de Figueiredo' in GoogleThis author has not been identified. Look up 'Luis Antonio Brasil Kowada' in GoogleThis author has not been identified. Look up 'Franklin L. Marquezino' in GoogleThis author has not been identified. Look up 'Renato Portugal' in GoogleThis author has not been identified. Look up 'Daniel Posner' in Google

runs on WebDSL