Author:
Blum Avrim,Konjevod Goran,Ravi R.,Vempala Santosh
Subject
General Computer Science,Theoretical Computer Science
Reference16 articles.
1. A. Blum, G. Konjevod, R. Ravi, S. Vempala, Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems, Proc. 30th Annual ACM Symp. on Theory of Computing, 1998, pp. 90–99.
2. The bandwidth problem for graphs and matrices — a survey;Chinn;J. Graph Theory,1982
3. Graphs with small band- and cutwidth;Chung;Discrete Math.,1989
4. A remark on a problem of Harary;Chvátal;Czechoslovak Math. J.,1970
5. G. Even. J. Naor, S. Rao, B. Schieber, Divide-and-conquer approximation algorithms via spreading metrics, Proc. 35th Annual Conf. on Foundations of Computer Science, 1996, pp. 62–71.
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Lower bounds for the bandwidth problem;Computers & Operations Research;2021-11
2. On the Embed and Project Algorithm for the Graph Bandwidth Problem;Mathematics;2021-08-24
3. Max Cut;Encyclopedia of Algorithms;2016
4. Graph Bandwidth;Encyclopedia of Algorithms;2016
5. On Bounding the Bandwidth of Graphs with Symmetry;INFORMS Journal on Computing;2015-02