A short note on the complexity of computing strong pathbreadth - Archive ouverte HAL
Journal Articles Information Processing Letters Year : 2018

A short note on the complexity of computing strong pathbreadth

Abstract

The strong pathbreadth of a given graph G is the minimum ρ such that G admits a Robertson and Seymour's path decomposition where every bag is the complete ρ-neighbourhood of some vertex in G. We prove that deciding whether a given graph has strong pathbreadth at most one is NP-complete. The latter answers negatively to a conjecture of [Leitert and Dragan, CO-COA'16].
Fichier principal
Vignette du fichier
IPL5627.pdf (208.5 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01735826 , version 1 (16-03-2018)

Identifiers

Cite

Guillaume Ducoffe. A short note on the complexity of computing strong pathbreadth. Information Processing Letters, 2018, 133, pp.56-58. ⟨10.1016/j.ipl.2018.01.005⟩. ⟨hal-01735826⟩
129 View
236 Download

Altmetric

Share

More