Pages that link to "Item:Q2420640"
From MaRDI portal
The following pages link to Fast exact algorithms for some connectivity problems parameterized by clique-width (Q2420640):
Displaying 10 items.
- On the terminal connection problem (Q831820) (← links)
- Feedback vertex set on graphs of low clique-width (Q1933648) (← links)
- Faster algorithms for vertex partitioning problems parameterized by clique-width (Q2447760) (← links)
- More Applications of the $d$-Neighbor Equivalence: Acyclicity and Connectivity Constraints (Q5009336) (← links)
- Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width (Q5173247) (← links)
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time (Q5494962) (← links)
- On the computational difficulty of the terminal connection problem (Q6041044) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
- Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space (Q6170447) (← links)
- Polynomial Turing compressions for some graph problems parameterized by modular-width (Q6591463) (← links)