Pages that link to "Item:Q1974445"
From MaRDI portal
The following pages link to Linear time solvable optimization problems on graphs of bounded clique-width (Q1974445):
Displaying 4 items.
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity (Q724225) (← links)
- Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity (Q1687933) (← links)
- Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (Q1751087) (← links)
- Approximating clique-width and branch-width (Q2496203) (← links)
