"A short note on the complexity of computing strong pathbreadth."

Guillaume Ducoffe (2018)

Details and statistics

DOI: 10.1016/J.IPL.2018.01.005

access: closed

type: Journal Article

metadata version: 2018-02-19

a service of  Schloss Dagstuhl - Leibniz Center for Informatics