Deciding Representability of Sets of Words of Equal Length in Polynomial Time

DOI10.1007/978-3-642-45278-9_4zbMath1407.68380OpenAlexW2253769010MaRDI QIDQ2870014

Sinziana Munteanu, Francine Blanchet-Sadri

Publication date: 17 January 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-45278-9_4

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Computing generalized de Bruijn sequences ⋮ Computing Minimum Length Representations of Sets of Words of Uniform Length ⋮ Computing minimum length representations of sets of words of uniform length

This page was built for publication: Deciding Representability of Sets of Words of Equal Length in Polynomial Time