Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Yukumoto, Hiroshi"'
Publikováno v:
Proceedings of the KOREA-JAPAN Joint Workshop on Algorithms and Computation. 2014:44-49
The B-BANDWIDTH problem is a decision problem whether the bandwidth of a given graph is smaller than B, and it is NP-complete even if the graph is a small graph class of trees. Cygan and Pilipczuk proposed exponential time and space algorithms for B-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=jairo_______::677f4b275dd1bb4acaecc7b74eaf8305
https://kyutech.repo.nii.ac.jp/records/5155
https://kyutech.repo.nii.ac.jp/records/5155
