Recognition of overlap graphs
From MaRDI portal
Recommendations
- Overlap number of graphs
- Recognizing random intersection graphs
- Recognition of unipolar and generalised split graphs
- Hierarchical overlap graph
- scientific article; zbMATH DE number 1146234
- Efficient Construction of Hierarchical Overlap Graphs
- Recognizing Graphs Close to Bipartite Graphs
- scientific article; zbMATH DE number 1263242
- Recognition of unigraphs through superposition of graphs
Cites work
- scientific article; zbMATH DE number 2086218 (Why is no real title available?)
- scientific article; zbMATH DE number 5074400 (Why is no real title available?)
- A greedy approximation algorithm for constructing shortest common superstrings
- A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem
- An Algorithm for Reconstructing Protein and RNA Sequences
- An algorithm for the detection and construction of Monge sequences
- An efficient algorithm for the all pairs suffix-prefix problem
- Approximating shortest superstrings with constraints
- Data compression via textual substitution
- Faster implementation of a shortest superstring approximation
- Linear approximation of shortest superstrings
- On Transportation Problems with Upper Bounds on Leading Rectangles
- On finding minimal length superstrings
- Sequential and Parallel Approximation of Shortest Superstrings
- Shortest common superstrings and scheduling with coordinated starting times
- The greedy travelling salesman's problem
- Viral Genome Compression
Cited in
(6)
This page was built for publication: Recognition of overlap graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405660)
