Pages that link to "Item:Q3057622"
From MaRDI portal
The following pages link to On the Boolean-Width of a Graph: Structure and Applications (Q3057622):
Displaying 11 items.
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems (Q392025) (← links)
- Parameterized complexity of generalized domination problems (Q415279) (← links)
- Boolean-width of graphs (Q719257) (← links)
- Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs (Q831858) (← links)
- Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis (Q1712018) (← links)
- C-planarity testing of embedded clustered graphs with bounded dual carving-width (Q2041980) (← links)
- The rank-width of edge-coloured graphs (Q2392245) (← links)
- A SAT Approach to Branchwidth (Q2818011) (← links)
- Finding Good Decompositions for Dynamic Programming on Dense Graphs (Q2891352) (← links)
- On the Boolean-Width of a Graph: Structure and Applications (Q3057622) (← links)
- Graph Classes with Structured Neighborhoods and Algorithmic Applications (Q3104764) (← links)
