A short note on the complexity of computing strong pathbreadth

Guillaume Ducoffe . A short note on the complexity of computing strong pathbreadth. Inf. Process. Lett., 133:56-58, 2018. [doi]

@article{Ducoffe18,
  title = {A short note on the complexity of computing strong pathbreadth},
  author = {Guillaume  Ducoffe },
  year = {2018},
  doi = {10.1016/j.ipl.2018.01.005},
  url = {https://doi.org/10.1016/j.ipl.2018.01.005},
  researchr = {https://researchr.org/publication/Ducoffe18},
  cites = {0},
  citedby = {0},
  journal = {Inf. Process. Lett.},
  volume = {133},
  pages = {56-58},
}