Pages that link to "Item:Q5062107"
From MaRDI portal
The following pages link to A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth (Q5062107):
Displaying 5 items.
- A polynomial time algorithm to compute the connected treewidth of a series-parallel graph (Q831866) (← links)
- Fixed-parameter tractable algorithms for tracking shortest paths (Q2210499) (← links)
- Improved FPT Algorithms for Rectilinear k-Links Spanning Path (Q2898068) (← links)
- A Polynomial Time Algorithm for Bounded Directed Pathwidth (Q3104788) (← links)
- Edge-treewidth: algorithmic and combinatorial properties (Q6069149) (← links)