Pages that link to "Item:Q5450349"

The following pages link to Rank‐width is less than or equal to branch‐width (Q5450349):

Displaying 24 items.

• Approximate tree decompositions of planar graphs in linear time (Q306256) (← links)
• Rank-width and tree-width of \(H\)-minor-free graphs (Q709231) (← links)
• Boolean-width of graphs (Q719257) (← links)
• \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth (Q972341) (← links)
• The rank-width of the square grid (Q972345) (← links)
• Graph operations characterizing rank-width (Q1028455) (← links)
• Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis (Q1712018) (← links)
• On quasi-planar graphs: clique-width and logical description (Q2174559) (← links)
• Branch-depth: generalizing tree-depth of graphs (Q2225398) (← links)
• Rank-width: algorithmic and structural results (Q2403788) (← links)
• From tree-decompositions to clique-width terms (Q2413974) (← links)
• Graphs of small rank-width are pivot-minors of graphs of small tree-width (Q2442212) (← links)
• Faster algorithms for vertex partitioning problems parameterized by clique-width (Q2447760) (← links)
• Vertex-minor reductions can simulate edge contractions (Q2457014) (← links)
• Rank-width of random graphs (Q2897211) (← links)
• On the Boolean-Width of a Graph: Structure and Applications (Q3057622) (← links)
• Boolean-Width of Graphs (Q3656851) (← links)
• The Rank-Width of the Square Grid (Q5302058) (← links)
• (Q5743430) (← links)
• Canonisation and Definability for Graphs of Bounded Rank Width (Q5875948) (← links)
• On low rank-width colorings (Q5918207) (← links)
• Tangle bases: Revisited (Q6087071) (← links)
• Classes of intersection digraphs with good algorithmic properties (Q6201028) (← links)
• Vertex-minors of graphs: a survey (Q6495258) (← links)