Author:
Gevezes Theodoros P.,Pitsoulis Leonidas S.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference19 articles.
1. Alon N, Cosares S, Hochbaum DS, Shamir R (1989) An algorithm for the detection and construction of monge sequences. Linear Algebra Appl 114115:669–680 ISSN: 0024-3795. Special issue dedicated to Alan J. Hoffman
2. Barnes ER, Hoffman AJ (1985) On transportation problems with upper bounds on leading rectangles. SIAM J Algebr Discret Methods 6(3):487–496
3. Blum A, Jiang T, Li M, Tromp J, Yannakakis M (1994) Linear approximation of shortest superstrings. J ACM 41:630–647 ISSN: 0004-5411
4. Braga MDV, Meidanis J (2002) An algorithm that builds a set of strings given its overlap graph. In Proceedings of the 5th Latin American symposium on theoretical informatics, LATIN ’02, pp 52–63, London, UK, Springer. ISBN: 3-540-43400-3
5. Czumaj A, Ga̧sieniec L, Piotrów M, Rytter W (1997) Sequential and parallel approximation of shortest superstrings. J Algorithms 23:74–100 ISSN: 0196-6774
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Bipartite graphs of small readability;Theoretical Computer Science;2020-02
2. Efficient Construction of Hierarchical Overlap Graphs;String Processing and Information Retrieval;2020
3. Bipartite Graphs of Small Readability;Lecture Notes in Computer Science;2018
4. On the readability of overlap digraphs;Discrete Applied Mathematics;2016-05
5. On the Readability of Overlap Digraphs;Combinatorial Pattern Matching;2015