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

Petr Golovach; Pinar Heggernes; Dieter Kratsch; Paloma Lima; Daniël Paulusma

doi:10.1007/978-3-319-68705-6_21

Book Sections Year : 2017

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

, , (1) , ,

1

Petr Golovach

Function : Author
PersonId : 1082126
ORCID : 0000-0002-2619-2990

Pinar Heggernes

Function : Author

Dieter Kratsch

Function : Author
PersonId : 753810
IdHAL : dieter-kratsch

Laboratoire d'Informatique Théorique et Appliquée

Paloma Lima

Function : Author

Daniël Paulusma

Function : Author
PersonId : 760105
ORCID : 0000-0001-5945-9287

Domains

Automatic

Jérémie Schutz : Connect in order to contact the contributor

https://hal.univ-lorraine.fr/hal-03242359

Submitted on : Monday, May 31, 2021-8:50:10 AM

Last modification on : Wednesday, April 6, 2022-8:54:04 PM

Dates and versions

hal-03242359 , version 1 (31-05-2021)

Identifiers

HAL Id : hal-03242359 , version 1
ARXIV : 1703.05102
DOI : 10.1007/978-3-319-68705-6_21

Cite

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

UNIV-LORRAINE TDS-MACS

15 View

0 Download