The following pages link to Testing branch-width (Q875941):
Displaying 18 items.
- First order convergence of matroids (Q326662) (← links)
- Decomposition width of matroids (Q415290) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Partitions versus sets: a case of duality (Q966122) (← links)
- Submodular partition functions (Q1045090) (← links)
- Polynomial-time algorithm for isomorphism of graphs with clique-width at most three (Q1986558) (← links)
- Rank-width: algorithmic and structural results (Q2403788) (← links)
- Faster algorithms for vertex partitioning problems parameterized by clique-width (Q2447760) (← links)
- Tangle and Maximal Ideal (Q2980900) (← links)
- (Q4251049) (← links)
- Covering Vectors by Spaces: Regular Matroids (Q4555045) (← links)
- Finding Branch-Decompositions of Matroids, Hypergraphs, and More (Q5013567) (← links)
- Intertwining Connectivities for Vertex-Minors and Pivot-Minors (Q5883288) (← links)
- Computing with tangles (Q5890774) (← links)
- Faster and enhanced inclusion-minimal cograph completion (Q5915859) (← links)
- Bounding branch-width (Q6133165) (← links)
- Fast FPT-approximation of branchwidth (Q6593764) (← links)
- Representing matroids over the reals is \(\exists \mathbb{R}\)-complete (Q6606993) (← links)
