A linear kernel for finding square roots of almost planar graphs

Petr Golovach; Dieter Kratsch; Daniël Paulusma; Anthony Stewart

doi:10.1016/j.tcs.2017.05.008

Journal Articles Theoretical Computer Science Year : 2017

A linear kernel for finding square roots of almost planar graphs

, (1) , ,

1

Petr Golovach

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

Dieter Kratsch

Function : Author
PersonId : 753810
IdHAL : dieter-kratsch

Laboratoire d'Informatique Théorique et Appliquée

Daniël Paulusma

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

Anthony Stewart

Function : Author

Domains

Automatic

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

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

Submitted on : Monday, May 31, 2021-8:22:48 AM

Last modification on : Wednesday, October 30, 2024-6:18:01 PM

Dates and versions

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

Identifiers

HAL Id : hal-03242340 , version 1
ARXIV : 1608.06136
DOI : 10.1016/j.tcs.2017.05.008

Cite

Petr Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart. A linear kernel for finding square roots of almost planar graphs. Theoretical Computer Science, 2017, 689, pp.36-47. ⟨10.1016/j.tcs.2017.05.008⟩. ⟨hal-03242340⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

UNIV-LORRAINE TDS-MACS ANR

22 View

0 Download

A linear kernel for finding square roots of almost planar graphs

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Altmetric

Share