An algorithm for maximum desequencing of repetition-free loops
From MaRDI portal
Publication:3217586
DOI10.1007/BF01068331zbMath0554.68012OpenAlexW2042529155MaRDI QIDQ3217586
No author found.
Publication date: 1983
Published in: Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01068331
Cites Work
This page was built for publication: An algorithm for maximum desequencing of repetition-free loops