The following pages link to The rank-width of the square grid (Q972345):
Displaying 13 items.
- The carving-width of generalized hypercubes (Q710586) (← links)
- Measuring what matters: a hybrid approach to dynamic programming with treewidth (Q2040028) (← links)
- Clique-width and edge contraction (Q2350597) (← links)
- Rank-width: algorithmic and structural results (Q2403788) (← links)
- Characterizing graphs of maximum matching width at most 2 (Q2413972) (← links)
- Branch decomposition heuristics for linear matroids (Q2445840) (← links)
- Faster algorithms for vertex partitioning problems parameterized by clique-width (Q2447760) (← links)
- Graph Classes with Structured Neighborhoods and Algorithmic Applications (Q3104764) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- Bounds for the Twin-Width of Graphs (Q5043639) (← links)
- Bipartite entanglement in continuous variable cluster states (Q5135175) (← links)
- The Rank-Width of the Square Grid (Q5302058) (← links)
- Thinness and its variations on some graph families and coloring graphs of bounded thinness (Q6550911) (← links)
