"De Bruijn Superwalk with Multiplicities Problem is NP-hard."

Evgeny Kapun, Fedor Tsarev (2013)

Details and statistics

DOI: 10.1186/1471-2105-14-S5-S7

access: open

type: Journal Article

metadata version: 2020-03-15

a service of  Schloss Dagstuhl - Leibniz Center for Informatics