Parameterized maximum path coloring
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1303779 (Why is no real title available?)
- scientific article; zbMATH DE number 637355 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- A note on optical routing on trees
- Algorithmic meta-theorems for restrictions of treewidth
- Call control with \(k\) rejections
- Color-coding
- Edge and vertex intersection of paths in a tree
- Linear FPT reductions and computational lower bounds
- On the complexity of \(k\)-SAT
- Optimal wavelength routing on directed fiber trees
- Parametrized complexity theory.
- Primal-dual approximation algorithms for integral flow and multicut in trees
- The Complexity of Coloring Circular Arcs and Chords
- The complexity of path coloring and call scheduling
- The maximum edge-disjoint paths problem in bidirected trees
Cited in
(6)- A note on the parameterized complexity of unordered maximum tree orientation
- Fixed-parameter tractability of maximum colored path and beyond
- Saving colors and max coloring: some fixed-parameter tractability results
- Grundy distinguishes treewidth from pathwidth
- Parameterized maximum path coloring
- Grundy Distinguishes Treewidth from Pathwidth
This page was built for publication: Parameterized maximum path coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q392021)