Algorithms and Computation
From MaRDI portal
Publication:5191641
DOI10.1007/b94771zbMath1205.05171OpenAlexW1769833081MaRDI QIDQ5191641
Publication date: 7 August 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b94771
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (8)
Models and Algorithms for Genome Rearrangement with Positional Constraints ⋮ A faster algorithm for maximum independent set on interval filament graphs ⋮ Counting hexagonal patches and independent sets in circle graphs ⋮ Improved algorithms for largest cardinality 2-interval pattern problem ⋮ A new distributed approximation algorithm for the maximum weight independent set problem ⋮ Computing maximum independent set on outerstring graphs and their relatives ⋮ Unnamed Item ⋮ An output sensitive algorithm for computing a maximum independent set of a circle graph
This page was built for publication: Algorithms and Computation
