Skip to Main content Skip to Navigation
Book section

Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2

Document type :
Book section
Complete list of metadata

https://hal.univ-lorraine.fr/hal-03242359
Contributor : Jérémie Schutz Connect in order to contact the contributor
Submitted on : Monday, May 31, 2021 - 8:50:10 AM
Last modification on : Tuesday, July 20, 2021 - 3:15:04 AM

Links full text

Identifiers

Collections

Citation

Petr Golovach, Pinar Heggernes, Dieter Kratsch, Paloma Lima, Daniël Paulusma. Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. WG 2017: Graph-Theoretic Concepts in Computer Science, pp.275-288, 2017, ⟨10.1007/978-3-319-68705-6_21⟩. ⟨hal-03242359⟩

Share

Metrics

Record views

18