scientific article
From MaRDI portal
Publication:2934676
zbMath1302.05134MaRDI QIDQ2934676
Martin Milanič, Vadim V. Lozin
Publication date: 18 December 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)
Related Items (13)
On independent vertex sets in subclasses of apple-free graphs ⋮ Independent sets in some classes of \(S_{i,j,k}\)-free graphs ⋮ Combining decomposition approaches for the maximum weight stable set problem ⋮ A fast approximation algorithm for the maximum 2-packing set problem on planar graphs ⋮ Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs ⋮ On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size ⋮ The Maximum Independent Set Problem in Planar Graphs ⋮ Independent Sets in Classes Related to Chair-Free Graphs ⋮ Graphs without large apples and the maximum weight independent set problem ⋮ On the maximum independent set problem in graphs of bounded maximum degree ⋮ Extending the MAX algorithm for maximum independent set ⋮ New sufficient conditions for \(\alpha\)-redundant vertices ⋮ The maximum independent set problem in subclasses of subcubic graphs
This page was built for publication:
