Pages that link to "Item:Q493242"

The following pages link to Computing tree-depth faster than \(2^n\) (Q493242):

Displaying 4 items.

• Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (Q1751087) (← links)
• A polynomial excluded-minor approximation of treedepth (Q2119392) (← links)
• (Q5028484) (← links)
• On the size of minimal separators for treedepth decomposition (Q6558688) (← links)