Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. Chinn, P., Chvátalová, J., Dewdney, A., Gibbs, N.: The bandwidth problem for graphs and matrices—a survey. J. Graph Theory 6, 223–254 (1982)
2. Ganian, R.: Thread graphs, linear rank-width and their algorithmic applications (manuscript),
http://is.muni.cz/www/99352/threadgraphs.pdf
3. Lecture Notes in Computer Science;R. Ganian,2009
4. Ganian, R., Hliněný, P.: On parse trees and Myhill–Nerode–type tools for handling graphs of bounded rank-width. Discrete Appl. Math. (2009) (to appear)
5. Gupta, A.: Improved bandwidth approximation for trees and chordal graphs. J. Algorithms 40(1), 24–36 (2001)
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献