On the Complexity of (k, l)-Graph Sandwich Problems - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Simone Dantas, Celina M. Herrera de Figueiredo, Luerbio Faria. On the Complexity of (k, l)-Graph Sandwich Problems. In Ludek Kucera, editor, Graph-Theoretic Concepts in Computer Science, 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers. Volume 2573 of Lecture Notes in Computer Science, pages 92-101, Springer, 2002. [doi]

This author has not been identified. Look up 'Simone Dantas' in GoogleThis author has not been identified. Look up 'Celina M. Herrera de Figueiredo' in GoogleThis author has not been identified. Look up 'Luerbio Faria' in Google

runs on WebDSL