Skip to Main content Skip to Navigation
Journal articles

A short note on the complexity of computing strong pathbreadth

Guillaume Ducoffe 1
1 COATI - Combinatorics, Optimization and Algorithms for Telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
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].
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01735826
Contributor : Guillaume Ducoffe <>
Submitted on : Friday, March 16, 2018 - 1:48:45 PM
Last modification on : Tuesday, May 26, 2020 - 6:50:53 PM
Document(s) archivé(s) le : Tuesday, September 11, 2018 - 3:19:59 AM

File

IPL5627.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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

Share

Metrics

Record views

522

Files downloads

256