Recognizing d-Interval Graphs and d-Track Interval Graphs
From MaRDI portal
Publication:3587347
DOI10.1007/978-3-642-14553-7_17zbMath1288.05278OpenAlexW1532677490MaRDI QIDQ3587347
Publication date: 7 September 2010
Published in: Frontiers in Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14553-7_17
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (5)
Parameterized Complexity in Multiple-Interval Graphs: Domination ⋮ Recognizing \(d\)-interval graphs and \(d\)-track interval graphs ⋮ On the parameterized complexity of some optimization problems related to multiple-interval graphs ⋮ Three ways to cover a graph ⋮ Edge-intersection graphs of grid paths: the bend-number
This page was built for publication: Recognizing d-Interval Graphs and d-Track Interval Graphs