Polynomial Fixed-parameter Algorithms: A Case Study for Longest Path on Interval Graphs
From MaRDI portal
Publication:5363764
DOI10.4230/LIPICS.IPEC.2015.102zbMath1378.68076OpenAlexW2963756941MaRDI QIDQ5363764
Rolf Niedermeier, Archontia C. Giannopoulou, George B. Mertzios
Publication date: 29 September 2017
Full work available at URL: http://dx.doi.org/10.4230/LIPIcs.IPEC.2015.102
data reductionpolynomial-time algorithminterval graphspreprocessingfixed-parameter algorithmlongest path problemproper interval vertex deletion set
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs ⋮ The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments ⋮ Efficient and Adaptive Parameterized Algorithms on Modular Decompositions
This page was built for publication: Polynomial Fixed-parameter Algorithms: A Case Study for Longest Path on Interval Graphs
