Better Polynomial Algorithms on Graphs of Bounded Rank-Width

DOI10.1007/978-3-642-10217-2_27zbMath1267.05258OpenAlexW1678653275MaRDI QIDQ3651552

Robert Ganian, Petr Hliněný

Publication date: 11 December 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10217-2_27

zbMATH Keywords

chromatic numberchromatic polynomialHamiltonian pathrank-widthpseudopolynomial algorithmsrank-decomposition

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Obstructions for linear rank-width at most 1 ⋮ Thread Graphs, Linear Rank-Width and Their Algorithmic Applications ⋮ On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width ⋮ On Digraph Width Measures in Parameterized Algorithmics

This page was built for publication: Better Polynomial Algorithms on Graphs of Bounded Rank-Width