Bipartite graphs of small readability
From MaRDI portal
Publication:5919328
DOI10.1016/j.tcs.2019.07.022zbMath1443.05161OpenAlexW2962934649MaRDI QIDQ5919328
Rayan Chikhi, Vladan Jovičić, Sofya Raskhodnikova, Martin Milanič, Nithin Varma, Stefan Kratsch, Paul Medvedev
Publication date: 16 January 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.07.022
Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the readability of overlap digraphs
- Recognition of overlap graphs
- A greedy approximation algorithm for constructing shortest common superstrings
- Unit disk graphs
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- On the recognition of de Bruijn graphs and their induced subgraphs
- Classification of de Bruijn-based labeled digraphs
- Recognizing DNA graphs is difficult.
- On some properties of DNA graphs
- Embedding on alphabet overlap digraphs
- Characterizations for some types of DNA graphs
- Approximating Layout Problems on Random Geometric Graphs
- The on-line encyclopedia of integer sequences
- Hamilton Paths in Grid Graphs
- Bipartite graphs of small readability
This page was built for publication: Bipartite graphs of small readability
