Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2 - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma. Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. Algorithmica, 81(7):2795-2828, 2019. [doi]

This author has not been identified. Look up 'Petr A. Golovach' in GoogleThis author has not been identified. Look up 'Pinar Heggernes' in GoogleThis author has not been identified. Look up 'Dieter Kratsch' in GoogleThis author has not been identified. Look up 'Paloma T. Lima' in GoogleThis author has not been identified. Look up 'Daniël Paulusma' in Google

runs on WebDSL