Parameterized maximum path coloring

DOI10.1016/j.tcs.2013.01.012zbMath1407.68228OpenAlexW2075531723MaRDI QIDQ392021

Michael Lampis

Publication date: 13 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.01.012

zbMATH Keywords

path coloringparameterized complexityEPT graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Grundy Distinguishes Treewidth from Pathwidth ⋮ Unnamed Item

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
• Algorithmic Meta-theorems for Restrictions of Treewidth
• The Complexity of Coloring Circular Arcs and Chords
• Color-coding
• The complexity of path coloring and call scheduling
• On the complexity of \(k\)-SAT

This page was built for publication: Parameterized maximum path coloring