The following pages link to Boolean-width of graphs (Q719257):
Displayed 3 items.
- Graph classes with structured neighborhoods and algorithmic applications (Q392023) (← links)
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems (Q392025) (← links)
- Finding Good Decompositions for Dynamic Programming on Dense Graphs (Q2891352) (← links)