Recognition of overlap graphs
From MaRDI portal
Publication:405660
DOI10.1007/S10878-013-9663-3zbMATH Open1298.90120OpenAlexW2014419530MaRDI QIDQ405660FDOQ405660
Authors: Theodoros P. Gevezes, Leonidas Pitsoulis 
Publication date: 5 September 2014
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-013-9663-3
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
- A greedy approximation algorithm for constructing shortest common superstrings
- Title not available (Why is that?)
- An efficient algorithm for the all pairs suffix-prefix problem
- On finding minimal length superstrings
- The greedy travelling salesman's problem
- Linear approximation of shortest superstrings
- Data compression via textual substitution
- An algorithm for the detection and construction of Monge sequences
- Shortest common superstrings and scheduling with coordinated starting times
- Faster implementation of a shortest superstring approximation
- Approximating shortest superstrings with constraints
- A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem
- Sequential and Parallel Approximation of Shortest Superstrings
- Title not available (Why is that?)
- On Transportation Problems with Upper Bounds on Leading Rectangles
- Viral Genome Compression
- An Algorithm for Reconstructing Protein and RNA Sequences
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)
