A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width
From MaRDI portal
Publication:1933649
DOI10.1016/j.ejc.2012.07.024zbMath1257.05168OpenAlexW2138209880MaRDI QIDQ1933649
Robert Ganian, Petr Hliněný, Jan Obdržálek
Publication date: 24 January 2013
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2012.07.024
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (10)
Computing directed Steiner path covers ⋮ The rank-width of edge-coloured graphs ⋮ Are there any good digraph width measures? ⋮ Directed NLC-width ⋮ Digraph width measures in parameterized algorithmics ⋮ Computations by fly-automata beyond monadic second-order logic ⋮ Measuring what matters: a hybrid approach to dynamic programming with treewidth ⋮ On the complexity of finding large odd induced subgraphs and odd colorings ⋮ Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. ⋮ Digraphs of Bounded Width
This page was built for publication: A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width
