"000280084100026" . "Although there exist many polynomial algorithms for NP-hard problems running on a bounded clique-width expression of the input graph, there exists only little comparable work on such algorithms for rank-width. We believe that one reason for this is the somewhat obscure and hard-to-grasp nature of rank-decompositions. Nevertheless, strong arguments for using the rank-width parameter have been given by recent formalisms independently developed by Courcelle and Kante, by the authors, and by Bui-Xuan et al. This article focuses on designing formally clean and understandable %22pseudopolynomial%22 (XP) algorithms solving %22hard%22 problems (non-FPT) on graphs of bounded rank-width. Those include computing the chromatic number and polynomial or testing the Hamiltonicity of a graph and are extendable to many other problems." . . "Hlin\u011Bn\u00FD, Petr" . "Hradec nad Moravic\u00ED" . "Better Polynomial Algorithms on Graphs of Bounded Rank-width."@en . . "[8B242D585955]" . "14330" . "Springer-Verlag" . "Berlin" . . . "rank-width; parameterized algorithms; graphs"@en . . "10.1007/978-3-642-10217-2" . . "Ganian, Robert" . "P(1M0545), P(GA201/08/0308), S, Z(MSM0021622419)" . "9783642102165" . . "RIV/00216224:14330/09:00065861!RIV14-MSM-14330___" . . "Better Polynomial Algorithms on Graphs of Bounded Rank-width." . . . . . "2009-01-01+01:00"^^ . "IWOCA 2009: International Workshop On Combinatorial Algorithms, Lecture Notes in Computer Science 5874" . "12"^^ . "Better Polynomial Algorithms on Graphs of Bounded Rank-width." . . "0302-9743" . "RIV/00216224:14330/09:00065861" . . "2"^^ . . "304931" . "Better Polynomial Algorithms on Graphs of Bounded Rank-width."@en . . . . . "2"^^ . "Although there exist many polynomial algorithms for NP-hard problems running on a bounded clique-width expression of the input graph, there exists only little comparable work on such algorithms for rank-width. We believe that one reason for this is the somewhat obscure and hard-to-grasp nature of rank-decompositions. Nevertheless, strong arguments for using the rank-width parameter have been given by recent formalisms independently developed by Courcelle and Kante, by the authors, and by Bui-Xuan et al. This article focuses on designing formally clean and understandable %22pseudopolynomial%22 (XP) algorithms solving %22hard%22 problems (non-FPT) on graphs of bounded rank-width. Those include computing the chromatic number and polynomial or testing the Hamiltonicity of a graph and are extendable to many other problems."@en . . .