Author:
Ando Kiyoshi,Kaneko Atsusi,Gervacio Severino
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference4 articles.
1. The bandwidth problem for graphs and matrices — a survey;Chinn;J. Graph Theory,1982
2. labellings of Graphs;Chung,1988
3. A remark on a problem of Harary;Chvátal;Czechoslovak Math. J.,1970
4. The bandwidth problem for graphs: a collection of recent results;Chvátalová,1975
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Bandwidth;Discrete Mathematics and Its Applications;2013-11-26
2. On the domination search number;Discrete Applied Mathematics;2003-05
3. Approximating Bandwidth by Mixing Layouts of Interval Graphs;SIAM Journal on Discrete Mathematics;2002-01
4. On the Domination Search Number;Graph-Theoretic Concepts in Computer Science;2000
5. Approximating Bandwidth by Mixing Layouts of Interval Graphs;STACS 99;1999