Bipartite graphs of small readability
From MaRDI portal
Recommendations
Cites work
- A greedy approximation algorithm for constructing shortest common superstrings
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Approximating layout problems on random geometric graphs
- Bipartite graphs of small readability
- Characterizations for some types of DNA graphs
- Classification of de Bruijn-based labeled digraphs
- Embedding on alphabet overlap digraphs
- Hamilton Paths in Grid Graphs
- scientific article; zbMATH DE number 2086218 (Why is no real title available?)
- scientific article; zbMATH DE number 3657869 (Why is no real title available?)
- scientific article; zbMATH DE number 1953078 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- On some properties of DNA graphs
- On the readability of overlap digraphs
- On the recognition of de Bruijn graphs and their induced subgraphs
- Recognition of overlap graphs
- Recognizing DNA graphs is difficult.
- The on-line encyclopedia of integer sequences
- Unit disk graphs
Cited in
(3)
This page was built for publication: Bipartite graphs of small readability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5919328)