The role of planarity in connectivity problems parameterized by treewidth - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier
Conference Papers Year : 2014

The role of planarity in connectivity problems parameterized by treewidth

Julien Baste
Algorithmes, Graphes et Combinatoire
Ignasi Sau
Algorithmes, Graphes et Combinatoire
CV

Abstract

For some years it was believed that for connectivity problems such as Hamiltonian Cycle [...]

Domains

Data Structures and Algorithms [cs.DS] Computational Complexity [cs.CC]
Fichier principal
Vignette du fichier
SparseDP-IPEC14-camera-ready.pdf (405.01 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Julien Baste  : Connect in order to contact the contributor

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01481432

Submitted on : Thursday, March 2, 2017-3:50:34 PM

Last modification on : Friday, March 8, 2024-6:57:19 PM

Long-term archiving on : Wednesday, May 31, 2017-3:24:07 PM

Download

Dates and versions

lirmm-01481432 , version 1 (02-03-2017)

Identifiers

Cite

Julien Baste, Ignasi Sau. The role of planarity in connectivity problems parameterized by treewidth. IPEC 2014 - 9th International Symposium on Parameterized and Exact Computation, Sep 2014, Wroclaw, Poland. pp.63-74, ⟨10.1007/978-3-319-13524-3_6⟩. ⟨lirmm-01481432⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS ALGCO LIRMM MIPS UNIV-MONTPELLIER
149 View
186 Download

Altmetric

Share

More