Pages that link to "Item:Q2447760"
From MaRDI portal
The following pages link to Faster algorithms for vertex partitioning problems parameterized by clique-width (Q2447760):
Displayed 6 items.
- Several notions of rank-width for countable graphs (Q505916) (← links)
- Solving Hamiltonian cycle by an EPT algorithm for a non-sparse parameter (Q2357164) (← links)
- Rank-width: algorithmic and structural results (Q2403788) (← links)
- When an optimal dominating set with given constraints exists (Q2420615) (← links)
- Fast exact algorithms for some connectivity problems parameterized by clique-width (Q2420640) (← links)
- Structural parameters, tight bounds, and approximation for \((k, r)\)-center (Q2422740) (← links)