The role of planarity in connectivity problems parameterized by treewidth

Acte de colloque

Open Access

Julien Baste et Ignasi Sau

LNCS, Vol.8894, pp.63-74

LNCS

IPEC 2014 - 9th International Symposium on Parameterized and Exact Computation (Wroclaw, Poland, 10/09/2014–12/09/2014)

2014

Résumé

Dynamic programming

Planar graphs

Single-exponential algorithms

Connectivity problems

Treewidth

Parameterized complexity

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

url

Find in HALAfficher

1 Consultations de la notice

Titre: The role of planarity in connectivity problems parameterized by treewidth
Créateurs - sans rôle: Julien Baste - Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier
Ignasi Sau - Centre National de la Recherche Scientifique
Détails de publication: LNCS, Vol.8894, pp.63-74
Colloque: IPEC 2014 - 9th International Symposium on Parameterized and Exact Computation (Wroclaw, Poland, 10/09/2014–12/09/2014)
Publications en série: LNCS
Identifiants: 99150336009311
Unité académique: Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier - LIRMM
Langue: English
Type de ressource: Conference proceeding
Champs locaux: lirmm-01481432