The following pages link to Computing rank-width exactly (Q989474):
Displaying 10 items.
- Computing efficiently the lattice width in any dimension (Q638564) (← links)
- The carving-width of generalized hypercubes (Q710586) (← links)
- \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth (Q972341) (← links)
- Rank-width: algorithmic and structural results (Q2403788) (← links)
- Approximating clique-width and branch-width (Q2496203) (← links)
- Bipartite entanglement in continuous variable cluster states (Q5135175) (← links)
- The Rank-Width of the Square Grid (Q5302058) (← links)
- Hardness of computing width parameters based on branch decompositions over the vertex set (Q5890909) (← links)
- Hardness of computing width parameters based on branch decompositions over the vertex set (Q5899662) (← links)
- Tangle bases: Revisited (Q6087071) (← links)
