Parameterized Maximum Path Coloring
From MaRDI portal
Publication:2891353
DOI10.1007/978-3-642-28050-4_19zbMath1352.68116MaRDI QIDQ2891353
Publication date: 15 June 2012
Published in: Parameterized and Exact Computation (Search for Journal in Brave)
Full work available at URL: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-58575
68Q25: Analysis of algorithms and problem complexity
05C15: Coloring of graphs and hypergraphs
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on optical routing on trees
- Primal-dual approximation algorithms for integral flow and multicut in trees
- Edge and vertex intersection of paths in a tree
- Call control with \(k\) rejections
- Optimal wavelength routing on directed fiber trees
- Parametrized complexity theory.
- The Maximum Edge-Disjoint Paths Problem in Bidirected Trees
- Linear FPT reductions and computational lower bounds
- The Complexity of Coloring Circular Arcs and Chords
- The complexity of path coloring and call scheduling
- On the complexity of \(k\)-SAT