Thread graphs, linear rank-width and their algorithmic applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6460 LNCS, Issue , 2011, Pages 38-42

  Ganian, Robert ^a  

^a MASARYK UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC APPLICATIONS; EFFICIENT ALGORITHM; GRAPH ALGORITHMS; GRAPH CLASS; HARD PROBLEMS; NP-HARD; NP-HARD PROBLEM; RANK-WIDTH; TREE-WIDTH;

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; GRAPHIC METHODS;

TREES (MATHEMATICS);

EID: 79953214565     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-19222-7_5     Document Type: Conference Paper

References (8)

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. Ganian, R., Hliněný, P.: Better polynomial algorithms on graphs of bounded rankwidth. In: Fiala, J., Kratochvíl, J., Miller, M. (eds.) IWOCA 2009. LNCS, vol. 5874, pp. 266-277. Springer, Heidelberg (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)
6. Mihai, R., Todinca, I.: Pathwidth is np-hard for weighted trees. In: Deng, X., Hopcroft, J.E., Xue, J. (eds.) FAW 2009. LNCS, vol. 5598, pp. 181-195. Springer, Heidelberg (2009)
7. Robertson, N., Seymour, P.D.: Graph minors. II. Algorithmic aspects of tree-width. Journal of Algorithms 7(3), 309-322 (1986)
8. Zhu, Q., Adam, Z., Choi, V., Sankoff, D.: Generalized gene adjacencies, graph bandwidth, and clusters in yeast evolution. IEEE/ACM Trans. Comput. Biol. Bioinformatics 6(2), 213-220 (2009)