Pages that link to "Item:Q3113705"
From MaRDI portal
The following pages link to Clique-width: when hard does not mean impossible (Q3113705):
Displaying 11 items.
- Are there any good digraph width measures? (Q896003) (← links)
- Directed NLC-width (Q906393) (← links)
- A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width (Q1933649) (← links)
- On width measures and topological problems on semi-complete digraphs (Q2312615) (← links)
- Fast exact algorithms for some connectivity problems parameterized by clique-width (Q2420640) (← links)
- Digraph width measures in parameterized algorithmics (Q2442211) (← links)
- Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width (Q3569083) (← links)
- (Q4625695) (← links)
- Clique is hard on average for regular resolution (Q5230344) (← links)
- An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width (Q5918121) (← links)
- MSO undecidability for hereditary classes of unbounded clique-width (Q6614399) (← links)