Pages that link to "Item:Q4575835"
From MaRDI portal
The following pages link to Fully polynomial-time parameterized computations for graphs and matrices of low treewidth (Q4575835):
Displaying 8 items.
- Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs (Q2402262) (← links)
- A linear-time parameterized algorithm for computing the width of a DAG (Q2672441) (← links)
- On the Power of Tree-Depth for Fully Polynomial FPT Algorithms (Q3304140) (← links)
- Revisiting Decomposition by Clique Separators (Q4610181) (← links)
- Efficient and Adaptive Parameterized Algorithms on Modular Decompositions (Q5009620) (← links)
- (Q5091021) (← links)
- The Power of Linear-Time Data Reduction for Maximum Matching (Q5111261) (← links)
- Solving systems of linear equations through zero forcing set (Q6591655) (← links)
