Parametric Problems on Graphs of Bounded Tree-Width
From MaRDI portal
Recommendations
Cited in
(14)- Fixed-parameter tractability of treewidth and pathwidth
- scientific article; zbMATH DE number 992954 (Why is no real title available?)
- Optimal Parametric Search on Graphs of Bounded Tree-Width
- The parameterised complexity of list problems on graphs of bounded treewidth
- scientific article; zbMATH DE number 4051021 (Why is no real title available?)
- scientific article; zbMATH DE number 24420 (Why is no real title available?)
- Solving parametric problems on trees
- On the complexity of time-dependent shortest paths
- scientific article; zbMATH DE number 1884458 (Why is no real title available?)
- Parametric problems on graphs of bounded tree-width
- Optimal parametric search on graphs of bounded tree-width
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
- Parameterized Approximation Schemes Using Graph Widths
- scientific article; zbMATH DE number 6292751 (Why is no real title available?)
This page was built for publication: Parametric Problems on Graphs of Bounded Tree-Width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4290915)