Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs
From MaRDI portal
Publication:3499734
DOI10.1007/11847250_15zbMath1154.68428MaRDI QIDQ3499734
Publication date: 3 June 2008
Published in: Parameterized and Exact Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11847250_15
68Q25: Analysis of algorithms and problem complexity
05C85: Graph algorithms (graph-theoretic aspects)
05C62: Graph representations (geometric and intersection representations, etc.)
Related Items
Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number, Intersections and circuits in sets of line segments, Parameterized complexity of the maximum independent set problem and the speed of hereditary properties, Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes, On the Directed Degree-Preserving Spanning Tree Problem